| Compressed full-text indexes G Navarro, V Mäkinen ACM Computing Surveys (CSUR) 39 (1), 2, 2007 | 786 | 2007 |
| Compressed representations of sequences and full-text indexes P Ferragina, G Manzini, V Mäkinen, G Navarro ACM Transactions on Algorithms (TALG) 3 (2), 20, 2007 | 389 | 2007 |
| Practical implementation of rank and select queries R González, S Grabowski, V Mäkinen, G Navarro Poster Proc. Volume of 4th Workshop on Efficient and Experimental Algorithms …, 2005 | 250 | 2005 |
| Succinct suffix arrays based on run-length encoding V Mäkinen, G Navarro Annual Symposium on Combinatorial Pattern Matching, 45-56, 2005 | 208 | 2005 |
| Storage and retrieval of highly repetitive sequence collections V Mäkinen, G Navarro, J Sirén, N Välimäki Journal of Computational Biology 17 (3), 281-308, 2010 | 183 | 2010 |
| The Glanville fritillary genome retains an ancient karyotype and reveals selective chromosomal fusions in Lepidoptera V Ahola, R Lehtonen, P Somervuo, L Salmela, P Koskinen, P Rastas, ... Nature communications 5 (1), 1-9, 2014 | 163 | 2014 |
| Rank and select revisited and extended V Mäkinen, G Navarro Theoretical Computer Science 387 (3), 332-347, 2007 | 162 | 2007 |
| Computational pan-genomics: status, promises and challenges Briefings in bioinformatics 19 (1), 118-135, 2018 | 159 | 2018 |
| An alphabet-friendly FM-index P Ferragina, G Manzini, V Mäkinen, G Navarro International Symposium on String Processing and Information Retrieval, 150-160, 2004 | 151 | 2004 |
| Indexing graphs for path queries with applications in genome research J Sirén, N Välimäki, V Mäkinen IEEE/ACM Transactions on Computational Biology and Bioinformatics 11 (2 …, 2014 | 136 | 2014 |
| Dynamic entropy-compressed sequences and full-text indexes V Mäkinen, G Navarro ACM Transactions on Algorithms (TALG) 4 (3), 1-38, 2008 | 123 | 2008 |
| Genome-scale algorithm design V Mäkinen, D Belazzougui, F Cunial, AI Tomescu Cambridge University Press, 2015 | 106 | 2015 |
| Faster entropy-bounded compressed suffix trees J Fischer, V Mäkinen, G Navarro Theoretical Computer Science 410 (51), 5354-5364, 2009 | 97 | 2009 |
| Geometric algorithms for transposition invariant content-based music retrieval E Ukkonen, K Lemström, V Mäkinen Johns Hopkins University, 2003 | 94 | 2003 |
| Space-efficient algorithms for document retrieval N Välimäki, V Mäkinen Annual Symposium on Combinatorial Pattern Matching, 205-215, 2007 | 90 | 2007 |
| Fast scaffolding with small independent mixed integer programs L Salmela, V Mäkinen, N Välimäki, J Ylinen, E Ukkonen Bioinformatics 27 (23), 3259-3265, 2011 | 88 | 2011 |
| Run-length compressed indexes are superior for highly repetitive sequence collections J Sirén, N Välimäki, V Mäkinen, G Navarro International Symposium on String Processing and Information Retrieval, 164-175, 2008 | 84 | 2008 |
| Implicit compression boosting with applications to self-indexing V Mäkinen, G Navarro International Symposium on String Processing and Information Retrieval, 229-241, 2007 | 82 | 2007 |
| Position-restricted substring searching V Mäkinen, G Navarro Latin American Symposium on Theoretical Informatics, 703-714, 2006 | 81 | 2006 |
| Compact suffix array—a space-efficient full-text index V Mäkinen Fundamenta Informaticae 56 (1-2), 191-210, 2003 | 72 | 2003 |
Gonzalo NavarroUniversity of ChileПодтвержден адрес электронной почты в домене dcc.uchile.cl
