Simon J. Puglisi
Simon J. Puglisi
Associate Professor, Department of Computer Science, University of Helsinki
Verified email at cs.helsinki.fi - Homepage
Title
Cited by
Cited by
Year
A taxonomy of suffix array construction algorithms
SJ Puglisi, WF Smyth, AH Turpin
acm Computing Surveys (CSUR) 39 (2), 4-es, 2007
3742007
SHREC: a short-read error correction method
J Schröder, H Schröder, SJ Puglisi, R Sinha, B Schmidt
Bioinformatics 25 (17), 2157-2163, 2009
1952009
Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
S Kuruppu, SJ Puglisi, J Zobel
International Symposium on String Processing and Information Retrieval, 201-206, 2010
1492010
Permuted longest-common-prefix array
J Kärkkäinen, G Manzini, SJ Puglisi
Annual Symposium on Combinatorial Pattern Matching, 181-192, 2009
1102009
New algorithms on wavelet trees and applications to information retrieval
T Gagie, G Navarro, SJ Puglisi
Theoretical Computer Science 426, 25-41, 2012
1032012
Order-preserving matching
J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ...
Theoretical Computer Science 525, 68-79, 2014
1002014
Optimized relative Lempel-Ziv compression of genomes
S Kuruppu, SJ Puglisi, J Zobel
Proceedings of the Thirty-Fourth Australasian Computer Science Conference …, 2011
912011
Range quantile queries: Another virtue of wavelet trees
T Gagie, SJ Puglisi, A Turpin
International Symposium on String Processing and Information Retrieval, 1-6, 2009
872009
A faster grammar-based self-index
T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi
International Conference on Language and Automata Theory and Applications …, 2012
842012
Top-k Ranked Document Search in General Text Databases
JS Culpepper, G Navarro, SJ Puglisi, A Turpin
European Symposium on Algorithms, 194-205, 2010
792010
Colored range queries and document retrieval
T Gagie, J Kärkkäinen, G Navarro, SJ Puglisi
Theoretical Computer Science 483, 36-50, 2013
712013
A fast hybrid short read fragment assembly algorithm
B Schmidt, R Sinha, B Beresford-Smith, SJ Puglisi
Bioinformatics 25 (17), 2279-2280, 2009
672009
How many runs can a string contain?
SJ Puglisi, J Simpson, WF Smyth
Theoretical Computer Science 401 (1-3), 165-171, 2008
672008
Lempel–Ziv Factorization Using Less Time & Space
G Chen, SJ Puglisi, WF Smyth
Mathematics in Computer Science 1 (4), 605-623, 2008
662008
Succinct colored de Bruijn graphs
MD Muggli, A Bowe, NR Noyes, PS Morley, KE Belk, R Raymond, T Gagie, ...
Bioinformatics 33 (20), 3181-3187, 2017
652017
LZ77-based self-indexing with faster pattern matching
T Gagie, P Gawrychowski, J Kärkkäinen, Y Nekrich, SJ Puglisi
Latin American Symposium on Theoretical Informatics, 731-742, 2014
642014
Linear time Lempel-Ziv factorization: Simple, fast, small
J Kärkkäinen, D Kempa, SJ Puglisi
Annual Symposium on Combinatorial Pattern Matching, 189-200, 2013
572013
Space-time tradeoffs for longest-common-prefix array computation
SJ Puglisi, A Turpin
International Symposium on Algorithms and Computation, 124-135, 2008
552008
Inverted files versus suffix arrays for locating patterns in primary memory
SJ Puglisi, WF Smyth, A Turpin
International Symposium on String Processing and Information Retrieval, 122-133, 2006
512006
The performance of linear time suffix sorting algorithms
SJ Puglisi, WF Smyth, A Turpin
Data Compression Conference, 358-367, 2005
512005
The system can't perform the operation now. Try again later.
Articles 1–20