| Genome-scale algorithm design V Mäkinen, D Belazzougui, F Cunial, AI Tomescu Cambridge University Press, 2015 | 155 | 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 | 89 | 2013 |
| Unicyclic and bicyclic graphs having minimum degree distance AI Tomescu Discrete applied mathematics 156 (1), 125-130, 2008 | 88 | 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 | 52 | 2012 |
| On the complexity of string matching for graphs M Equi, R Grossi, V Mäkinen, A Tomescu 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 40 | 2019 |
| Safe and complete contig assembly through omnitigs AI Tomescu, P Medvedev Journal of computational biology 24 (6), 590-602, 2017 | 39* | 2017 |
| 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 | 38 | 2014 |
| 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 | 34* | 2019 |
| 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 | 28 | 2016 |
| Set graphs. I. Hereditarily finite sets and extensional acyclic orientations M Milanič, AI Tomescu Discrete Applied Mathematics 161 (4-5), 677-690, 2013 | 26 | 2013 |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails M Equi, V Mäkinen, AI Tomescu SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021 | 25 | 2021 |
| 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 | 25 | 2014 |
| Counting extensional acyclic digraphs A Policriti, AI Tomescu Information Processing Letters 111 (16), 787-791, 2011 | 23 | 2011 |
| Metaflow: Metagenomic profiling based on whole-genome coverage analysis with min-cost flows A Sobih, AI Tomescu, V Mäkinen Research in Computational Molecular Biology: 20th Annual Conference, RECOMB …, 2016 | 19 | 2016 |
| A rank-based sequence aligner with applications in phylogenetic analysis LP Dinu, RT Ionescu, AI Tomescu PloS one 9 (8), e104006, 2014 | 19 | 2014 |
| 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 | 19 | 2013 |
| A randomized numerical aligner (rna) A Policriti, AI Tomescu, F Vezzi Journal of Computer and System Sciences 78 (6), 1868-1882, 2012 | 19 | 2012 |
| 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 | 17 | 2020 |
| SNV-PPILP: refined SNV calling for tumor data using perfect phylogenies and ILP KE van Rens, V Mäkinen, AI Tomescu Bioinformatics 31 (7), 1133-1135, 2015 | 17 | 2015 |
| Mapping sets and hypersets into numbers G D’Agostino, EG Omodeo, A Policriti, AI Tomescu Fundamenta Informaticae 140 (3-4), 307-328, 2015 | 17* | 2015 |
Veli MäkinenProfessor of Computer Science, University of HelsinkiBestätigte E-Mail-Adresse bei helsinki.fi
