Andrea D'AScenzo
Andrea D'AScenzo has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Mattia D'Emidio
University of L’Aquila
2 shared publications - Anna Mpanti1 shared publication
- Aris Pagourtzis
National Technical University of Athens Greece
1 shared publication Claudio Arbib
Department of Information Engineering, Computer Science, and Mathematics University of L'Aquila, L'Aquila, Italy
1 shared publicationClément Rambaud
1 shared publication- Daniele Santoni
Institute for Systems Analysis and Computer Science “Antonio Ruberti”, National Research Council of Italy, Rome, RM 00185, Italy
1 shared publication
Latest Publications
- 7 June 2026
- Published by Springer Nature
- p. 220-235
Beer Path Problems in Temporal Graphs
- Open Access
- 17 March 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1039
k-shortest simple paths in bounded treewidth graphs
- 17 March 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1039
Open Accessk-shortest simple paths in bounded treewidth graphs
- 24 January 2025
- Published by Springer Nature
- p. 320-336
On Mining Dynamic Graphs for k Shortest Paths
- 1 May 2024
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 31 (5) , 416-428
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators
A Coding DNA Sequence (CDS) is a fraction of DNA whose nucleotides are grouped into consecutive triplets called codons, each one encoding an amino acid. Because most amino acids can be encoded by more than one codon, the same amino acid chain can be obtained by a very large number of different CDSs. These synonymous CDSs show different features that, also depending on the organism the transcript is expressed in, could affect translational efficiency and yield. The identification of optimal CDSs with respect to given transcript indicators is in general a challenging task, but it has been observed in recent literature that integer linear programming (ILP) can be a very flexible and efficient way to achieve it. In this article, we add evidence to this observation by proposing a new ILP model that simultaneously optimizes different well-grounded indicators. With this model, we efficiently find solutions that dominate those returned by six existing codon optimization heuristics.
- 1 May 2024
- Published by SAGE Publications in Journal of Computational Biology
- Vol. 31 (5) , 416-428
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators
A Coding DNA Sequence (CDS) is a fraction of DNA whose nucleotides are grouped into consecutive triplets called codons, each one encoding an amino acid. Because most amino acids can be encoded by more than one codon, the same amino acid chain can be obtained by a very large number of different CDSs. These synonymous CDSs show different features that, also depending on the organism the transcript is expressed in, could affect translational efficiency and yield. The identification of optimal CDSs with respect to given transcript indicators is in general a challenging task, but it has been observed in recent literature that integer linear programming (ILP) can be a very flexible and efficient way to achieve it. In this article, we add evidence to this observation by proposing a new ILP model that simultaneously optimizes different well-grounded indicators. With this model, we efficiently find solutions that dominate those returned by six existing codon optimization heuristics.
- Open Access
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 102228-102242
Top-k Distance Queries on Large Time-Evolving Graphs
Fast extraction of top- k distances from graph data is a primitive of paramount importance in the fields of data mining, network analytics and machine learning, where ranked distances are exploited for several purposes (e.g. link prediction or network classification). While investigation on computational methods to address this retrieval task for regularly sized, static inputs has been extensive, much less is known when managed graphs are massive , i.e. having millions of vertices/edges, and time-evolving , i.e. when their structure can grow over time, a scenario that introduces a number of scalability and effectiveness issues otherwise not arising. Since, nowadays, most real-world applications exploiting top- k distances have to handle inherently dynamic and rapidly growing graphs, in this paper we present the first dynamic indexing scheme that supports very fast queries on top- k distances when graphs are massive and incrementally time-evolving. We assess the scalability and effectiveness of our method through extensive experimentation on both real-world and artificial graph datasets.
- 18 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 102228-102242
Open AccessTop-k Distance Queries on Large Time-Evolving Graphs
Fast extraction of top- k distances from graph data is a primitive of paramount importance in the fields of data mining, network analytics and machine learning, where ranked distances are exploited for several purposes (e.g. link prediction or network classification). While investigation on computational methods to address this retrieval task for regularly sized, static inputs has been extensive, much less is known when managed graphs are massive , i.e. having millions of vertices/edges, and time-evolving , i.e. when their structure can grow over time, a scenario that introduces a number of scalability and effectiveness issues otherwise not arising. Since, nowadays, most real-world applications exploiting top- k distances have to handle inherently dynamic and rapidly growing graphs, in this paper we present the first dynamic indexing scheme that supports very fast queries on top- k distances when graphs are massive and incrementally time-evolving. We assess the scalability and effectiveness of our method through extensive experimentation on both real-world and artificial graph datasets.