Alexandru I. Tomescu
Alexandru I. Tomescu
Department of Computer Science, University of Helsinki
Verified email at - Homepage
Cited by
Cited by
Genome-scale algorithm design
V Mäkinen, D Belazzougui, F Cunial, AI Tomescu
Cambridge University Press, 2015
A novel min-cost flow method for estimating transcript expression with RNA-Seq
AI Tomescu, A Kuosmanen, R Rizzi, V Mäkinen
BMC bioinformatics 14, 1-10, 2013
Unicyclic and bicyclic graphs having minimum degree distance
AI Tomescu
Discrete applied mathematics 156 (1), 125-130, 2008
rNA: a fast and accurate short reads numerical aligner
F Vezzi, C Del Fabbro, AI Tomescu, A Policriti
Bioinformatics 28 (1), 123-124, 2012
On the complexity of string matching for graphs
M Equi, V Mäkinen, AI Tomescu, R Grossi
ACM Transactions on Algorithms 19 (3), 1-25, 2023
Safe and complete contig assembly through omnitigs
AI Tomescu, P Medvedev
Journal of computational biology 24 (6), 590-602, 2017
Sparse dynamic programming on DAGs with small width
V Mäkinen, AI Tomescu, A Kuosmanen, T Paavilainen, T Gagie, R Chikhi
ACM Transactions on Algorithms (TALG) 15 (2), 1-21, 2019
On the complexity of minimum path cover with subpath constraints for multi-assembly
R Rizzi, AI Tomescu, V Mäkinen
BMC bioinformatics 15 (9), 1-11, 2014
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
M Equi, V Mäkinen, AI Tomescu
Theoretical Computer Science 975, 114128, 2023
Gap filling as exact path length problem
L Salmela, K Sahlin, V Mäkinen, AI Tomescu
Journal of Computational Biology 23 (5), 347-361, 2016
Set graphs. III. Proof Pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
EG Omodeo, AI Tomescu
Journal of automated reasoning 52, 1-29, 2014
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
M Milanič, AI Tomescu
Discrete Applied Mathematics 161 (4-5), 677-690, 2013
Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time
M Cáceres, M Cairo, B Mumey, R Rizzi, AI Tomescu
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Counting extensional acyclic digraphs
A Policriti, AI Tomescu
Information Processing Letters 111 (16), 787-791, 2011
Linear time construction of indexable founder block graphs
V Mäkinen, B Cazaux, M Equi, T Norri, AI Tomescu
arXiv preprint arXiv:2005.09342, 2020
Metaflow: Metagenomic profiling based on whole-genome coverage analysis with min-cost flows
A Sobih, AI Tomescu, V Mäkinen
International Conference on Research in Computational Molecular Biology, 111-121, 2016
On sets and graphs: Perspectives on logic and combinatorics
EG Omodeo, A Policriti, AI Tomescu
Springer, 2017
Indexes for jumbled pattern matching in strings, trees and graphs
F Cicalese, T Gagie, E Giaquinta, ES Laber, Z Lipták, R Rizzi, AI Tomescu
String Processing and Information Retrieval: 20th International Symposium …, 2013
A rank-based sequence aligner with applications in phylogenetic analysis
LP Dinu, RT Ionescu, AI Tomescu
PloS one 9 (8), e104006, 2014
A randomized numerical aligner (rna)
A Policriti, AI Tomescu, F Vezzi
Journal of Computer and System Sciences 78 (6), 1868-1882, 2012
The system can't perform the operation now. Try again later.
Articles 1–20