Följ
Simon J. Puglisi
Simon J. Puglisi
Professor, Department of Computer Science, University of Helsinki
Verifierad e-postadress på cs.helsinki.fi - Startsida
Titel
Citeras av
Citeras av
År
A taxonomy of suffix array construction algorithms
SJ Puglisi, WF Smyth, AH Turpin
acm Computing Surveys (CSUR) 39 (2), 4-es, 2007
4052007
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
2102009
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
1832010
Permuted longest-common-prefix array
J Kärkkäinen, G Manzini, SJ Puglisi
Combinatorial Pattern Matching: 20th Annual Symposium, CPM 2009 Lille …, 2009
1432009
Order-preserving matching
J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ...
Theoretical Computer Science 525, 68-79, 2014
1402014
New algorithms on wavelet trees and applications to information retrieval
T Gagie, G Navarro, SJ Puglisi
Theoretical Computer Science 426, 25-41, 2012
1302012
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
1162017
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
1102012
Optimized relative Lempel-Ziv compression of genomes
S Kuruppu, SJ Puglisi, J Zobel
Proceedings of the Thirty-Fourth Australasian Computer Science Conference …, 2011
1082011
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
952009
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
892014
Colored range queries and document retrieval
T Gagie, J Kärkkäinen, G Navarro, SJ Puglisi
Theoretical Computer Science 483, 36-50, 2013
812013
Top-k Ranked Document Search in General Text Databases
JS Culpepper, G Navarro, SJ Puglisi, A Turpin
Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010
812010
Linear time Lempel-Ziv factorization: Simple, fast, small
J Kärkkäinen, D Kempa, SJ Puglisi
Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad …, 2013
802013
Variable-order de Bruijn graphs
C Boucher, A Bowe, T Gagie, SJ Puglisi, K Sadakane
2015 data compression conference, 383-392, 2015
782015
Lempel–Ziv Factorization Using Less Time & Space
G Chen, SJ Puglisi, WF Smyth
Mathematics in Computer Science 1 (4), 605-623, 2008
762008
How many runs can a string contain?
SJ Puglisi, J Simpson, WF Smyth
Theoretical Computer Science 401 (1-3), 165-171, 2008
742008
A fast hybrid short read fragment assembly algorithm
B Schmidt, R Sinha, B Beresford-Smith, SJ Puglisi
Bioinformatics 25 (17), 2279-2280, 2009
722009
Data structures based on k-mers for querying large collections of sequencing data sets
C Marchet, C Boucher, SJ Puglisi, P Medvedev, M Salson, R Chikhi
Genome Research 31 (1), 1-12, 2021
682021
Space-time tradeoffs for longest-common-prefix array computation
SJ Puglisi, A Turpin
International Symposium on Algorithms and Computation, 124-135, 2008
612008
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20