Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
256 | Dong Kyue Kim, Jeong Eun Jeon, Heejin Park |
An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size. |
SPIRE |
2004 |
DBLP DOI BibTeX RDF |
|
245 | Dong Kyue Kim, Minhwan Kim, Heejin Park |
Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Index data structures, Suffix trees, Suffix arrays, String algorithms |
138 | Ching-Fung Cheung, Jeffrey Xu Yu, Hongjun Lu |
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory. |
IEEE Trans. Knowl. Data Eng. |
2005 |
DBLP DOI BibTeX RDF |
database index and suffix tree, Biological sequences |
135 | Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan 0001 |
On the sorting-complexity of suffix tree construction. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
DAM model, RAM model, sorting complexity, suffix tree, suffix array, external-memory data structures |
133 | Dong Kyue Kim, Heejin Park |
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. |
CPM |
2005 |
DBLP DOI BibTeX RDF |
|
124 | Dong Kyue Kim, Junha Jo, Heejin Park |
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. |
WEA |
2004 |
DBLP DOI BibTeX RDF |
|
111 | Dror Baron, Yoram Bresler |
Antisequential Suffix Sorting for BWT-Based Data Compression. |
IEEE Trans. Computers |
2005 |
DBLP DOI BibTeX RDF |
suffix sorting, VLSI, data compression, source coding, Burrows Wheeler transform |
111 | Yuanyuan Tian, Sandeep Tata, Richard A. Hankins, Jignesh M. Patel |
Practical methods for constructing suffix trees. |
VLDB J. |
2005 |
DBLP DOI BibTeX RDF |
Suffix tree construction, sequence matching |
111 | Richard Cole 0001, Tsvi Kopelowitz, Moshe Lewenstein |
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. |
ICALP (1) |
2006 |
DBLP DOI BibTeX RDF |
|
102 | Amol Ghoting, Konstantin Makarychev |
Serial and parallel methods for i/o efficient suffix tree construction. |
SIGMOD Conference |
2009 |
DBLP DOI BibTeX RDF |
disk-based, genome indexing, sequence indexing, parallel, suffix tree, external memory |
98 | Ranjan Sinha, Simon J. Puglisi, Alistair Moffat, Andrew Turpin |
Improving suffix array locality for fast pattern matching on disk. |
SIGMOD Conference |
2008 |
DBLP DOI BibTeX RDF |
disk-based algorithm, pattern matching, suffix tree, suffix array, secondary storage |
98 | Tetsuo Shibuya |
Generalization of a Suffix Tree for RNA Structural Pattern Matching. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Suffix tree generalization, Parameterized suffix tree, RNA structure matching, Pattern matching, Computational biology |
95 | Michael A. Maniscalco, Simon J. Puglisi |
An efficient, versatile approach to suffix sorting. |
ACM J. Exp. Algorithmics |
2007 |
DBLP DOI BibTeX RDF |
Suffix sorting, suffix tree, suffix array, Burrows-Wheeler transform |
95 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
A taxonomy of suffix array construction algorithms. |
ACM Comput. Surv. |
2007 |
DBLP DOI BibTeX RDF |
suffix sorting, suffix tree, Suffix array, Burrows-Wheeler transform |
93 | Benjarath Phoophakdee, Mohammed J. Zaki |
Genome-scale disk-based suffix tree indexing. |
SIGMOD Conference |
2007 |
DBLP DOI BibTeX RDF |
disk-based, genome-scale, sequence indexing, suffix tree, external memory |
93 | Juha Kärkkäinen, Peter Sanders 0001, Stefan Burkhardt |
Linear work suffix array construction. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Difference cover, suffix array, external memory algorithms |
89 | Mauricio Ayala-Rincón, Paulo D. Conejo |
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Suffix trie, Suffix tree, Linear-time algorithm |
87 | Shunsuke Inenaga, Masayuki Takeda |
On-Line Linear-Time Construction of Word Suffix Trees. |
CPM |
2006 |
DBLP DOI BibTeX RDF |
|
87 | Pang Ko, Srinivas Aluru |
Space Efficient Linear Time Construction of Suffix Arrays. |
CPM |
2003 |
DBLP DOI BibTeX RDF |
|
84 | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton |
Suffix trees for very large genomic sequences. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
suffix tree, external memory algorithms |
84 | Joong Chae Na, Kunsoo Park |
Data Compression with Truncated Suffix Trees. |
Data Compression Conference |
2000 |
DBLP DOI BibTeX RDF |
Ziv-Lempel coding, LZ77, data compression, suffix tree, sliding window |
78 | Kunihiko Sadakane |
Compressed Suffix Trees with Full Functionality. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
78 | Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong |
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences. |
ICDE |
2007 |
DBLP DOI BibTeX RDF |
|
78 | Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen |
Engineering a Compressed Suffix Tree Implementation. |
WEA |
2007 |
DBLP DOI BibTeX RDF |
|
78 | Klaus-Bernd Schürmann, Jens Stoye |
Counting Suffix Arrays and Strings. |
SPIRE |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Veli Mäkinen, Gonzalo Navarro 0001 |
Compressed Compact Suffix Arrays. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
78 | Raphaël Clifford, Marek J. Sergot |
Distributed and Paged Suffix Trees for Large Genetic Databases. |
CPM |
2003 |
DBLP DOI BibTeX RDF |
|
78 | Veli Mäkinen |
Trade Off Between Compression and Search Times in Compact Suffix Array. |
ALENEX |
2001 |
DBLP DOI BibTeX RDF |
|
75 | Feng Shao, Gang Chen 0001, Jinxiang Dong |
Accelerating XML Structural Matching Using Suffix Bitmaps. |
International Conference on Computational Science (1) |
2007 |
DBLP DOI BibTeX RDF |
Suffix Bitmap, XML, Filtering, Structural Matching |
75 | Arne Andersson, N. Jesper Larsson, Kurt Swanson |
Suffix Trees on Words. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Substring searching, Suffix trees |
73 | Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung |
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
71 | Giovanni Manzini, Paolo Ferragina |
Engineering a Lightweight Suffix Array Construction Algorithm. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Space-economical algorithms, Full-text index, Suffix tree, Suffix array, Algorithmic engineering |
69 | Alistair Moffat, Simon J. Puglisi, Ranjan Sinha |
Reducing Space Requirements for Disk Resident Suffix Arrays. |
DASFAA |
2009 |
DBLP DOI BibTeX RDF |
|
69 | Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira |
Fully-Compressed Suffix Trees. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
69 | Hongwei Huo, Vojislav Stojkovic |
A Suffix Tree Construction Algorithm for DNA Sequences. |
BIBE |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Tetsuo Shibuya |
Prefix-Shuffled Geometric Suffix Tree. |
SPIRE |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Pang Ko, Srinivas Aluru |
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. |
CPM |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Choon Hui Teo, S. V. N. Vishwanathan |
Fast and space efficient string kernels using suffix arrays. |
ICML |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park |
Linear-Time Construction of Suffix Arrays. |
CPM |
2003 |
DBLP DOI BibTeX RDF |
|
69 | Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch |
The Enhanced Suffix Array and Its Applications to Genome Analysis. |
WABI |
2002 |
DBLP DOI BibTeX RDF |
|
66 | Gang Chen, Simon J. Puglisi, William F. Smyth |
Lempel-Ziv Factorization Using Less Time & Space. |
Math. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
Lempel-Ziv factorization, LZ factorization, suffix tree, suffix array |
66 | Paolo Ferragina, Roberto Grossi |
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
Patricia trie, prefix and range search, string searching and sorting, text index, suffix tree, B-tree, suffix array, external-memory data structure |
65 | Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders 0001 |
Better external memory suffix array construction. |
ACM J. Exp. Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
algorithms for strings, suffix array, external memory, large data sets, Algorithm engineering, I/O-efficient, secondary memory |
65 | Hideo Itoh, Hozumi Tanaka |
An Efficient Method for in Memory Construction of Suffix Arrays. |
SPIRE/CRIWG |
1999 |
DBLP DOI BibTeX RDF |
string processing, indexing, sorting, suffix array, text search |
65 | Martin Farach |
Optimal Suffix Tree Construction with Large Alphabets. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
large alphabets, combinatorial pattern matching, integer alphabet, integer alphabets, data structure, pattern matching, sorting, suffix tree |
64 | Kseniya B. Shalonova, Bruno Golénia, Peter A. Flach |
Towards Learning Morphology for Under-Resourced Fusional and Agglutinating Languages. |
IEEE Trans. Speech Audio Process. |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Martin Fiala, Jan Holub 0001 |
DCA Using Suffix Arrays. |
DCC |
2008 |
DBLP DOI BibTeX RDF |
Data Compression using Antidictionaries, suffix trie, suffix array |
60 | Jérémie Bourdon, Irena Rusu |
Statistical Properties of Factor Oracles. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
factor recognition, suffix recognition, average-case analysis, indexing structure |
60 | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane |
Compressed indexes for dynamic text collections. |
ACM Trans. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Compressed suffix tree, string matching |
60 | Ela Hunt, Malcolm P. Atkinson 0001, Robert W. Irving |
Database indexing for large DNA and protein sequence collections. |
VLDB J. |
2002 |
DBLP DOI BibTeX RDF |
Suffix tree, Approximate matching, Database index, Biological sequence |
60 | Enno Ohlebusch, Simon Gog |
A Compressed Enhanced Suffix Array Supporting Fast String Matching. |
SPIRE |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira |
Dynamic Fully-Compressed Suffix Trees. |
CPM |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Paolo Ferragina, Johannes Fischer 0001 |
Suffix Arrays on Words. |
CPM |
2007 |
DBLP DOI BibTeX RDF |
|
60 | Gianni Franceschini, S. Muthukrishnan 0001 |
Optimal suffix selection. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
suffixes, selection, strings, order statistics |
60 | Tetsuo Shibuya |
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures. |
CPM |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
Suffix arrays: what are they good for? |
ADC |
2006 |
DBLP BibTeX RDF |
|
60 | Martin Senft |
Compressed by the Suffix Tree. |
DCC |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane |
Dynamic dictionary matching and compressed suffix trees. |
SODA |
2005 |
DBLP BibTeX RDF |
|
60 | Jeong Seop Sim |
Time and Space Efficient Search for Small Alphabets with Suffix Arrays. |
FSKD (1) |
2005 |
DBLP DOI BibTeX RDF |
|
60 | Srikanta J. Bedathur, Jayant R. Haritsa |
Engineering a Fast Online Persistent Suffix Tree Construction. |
ICDE |
2004 |
DBLP DOI BibTeX RDF |
|
60 | Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz |
Optimal Exact Strring Matching Based on Suffix Arrays. |
SPIRE |
2002 |
DBLP DOI BibTeX RDF |
|
60 | Veli Mäkinen |
Compact Suffix Array. |
CPM |
2000 |
DBLP DOI BibTeX RDF |
|
60 | Paolo Ferragina, Roberto Grossi, Manuela Montangero |
A Note on Updating Suffix Tree Labels. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
60 | Martin Farach, S. Muthukrishnan 0001 |
Optimal Logarithmic Time Randomized Suffix Tree Construction. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
58 | Donald A. Adjeroh, Fei Nan |
Suffix Sorting via Shannon-Fano-Elias Codes. |
DCC |
2008 |
DBLP DOI BibTeX RDF |
Suffix sorting, information theory, suffix trees, suffix arrays, prefix codes, space efficiency |
58 | S. Rao Kosaraju |
Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
parameterized suffix trees, suffix tree algorithm, code duplication problem, computational complexity, pattern matching, trees (mathematics), string matching, suffix tree, algorithm theory |
56 | Timothy de Vries, Hui Ke, Sanjay Chawla, Peter Christen |
Robust record linkage blocking using suffix arrays. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
blocking, suffix arrays, record linkage |
56 | Junze Wang, Yijun Mo, Benxiong Huang, Jie Wen 0003, Li He 0001 |
Web Search Results Clustering Based on a Novel Suffix Tree Structure. |
ATC |
2008 |
DBLP DOI BibTeX RDF |
a new suffix tree, lower memory requirement, document clustering, incremental clustering, Search results organization |
56 | Hung Chim, Xiaotie Deng |
A new suffix tree similarity measure for document clustering. |
WWW |
2007 |
DBLP DOI BibTeX RDF |
similarity measure, suffix tree, document model |
56 | Rajesh Mysore Pampapathi, Boris G. Mirkin, Mark Levene |
A suffix tree approach to anti-spam email filtering. |
Mach. Learn. |
2006 |
DBLP DOI BibTeX RDF |
E-mail filtering, Text categorization, Spam, Suffix tree, Scoring function |
56 | Robert Tairas, Jeff Gray 0001 |
Phoenix-based clone detection using suffix trees. |
ACM Southeast Regional Conference |
2006 |
DBLP DOI BibTeX RDF |
suffix trees, clone detection, software analysis, code clones |
51 | Veli Mäkinen, Gonzalo Navarro 0001, Jouni Sirén, Niko Välimäki |
Storage and Retrieval of Individual Genomes. |
RECOMB |
2009 |
DBLP DOI BibTeX RDF |
full-text indexing, compressed data structures, suffix tree, Comparative genomics |
51 | Gabriele Fici |
Combinatorics of Finite Words and Suffix Automata. |
CAI |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo |
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Roberto Grossi |
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Johannes Fischer 0001, Veli Mäkinen, Gonzalo Navarro 0001 |
An(other) Entropy-Bounded Compressed Suffix Tree. |
CPM |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Maxim A. Babenko, Tatiana Starikovskaya |
Computing Longest Common Substrings Via Suffix Arrays. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Heikki Hyyrö |
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper). |
SPIRE |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park |
On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu |
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Gianni Franceschini, S. Muthukrishnan 0001 |
In-Place Suffix Sorting. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Ge Nong, Sen Zhang |
Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Hui Liu 0003, Zhiyi Ma, Lu Zhang 0023, Weizhong Shao |
Detecting Duplications in Sequence Diagrams Based on Suffix Trees. |
APSEC |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Srikanta J. Bedathur, Jayant R. Haritsa |
Search-Optimized Suffix-Tree Storage for Biological Applications. |
HiPC |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Chunxi Chen, Bertil Schmidt |
Parallel Construction of Large Suffix Trees on a PC Cluster. |
Euro-Par |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Martin Senft |
Suffix Tree Based Data Compression. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Joong Chae Na, Raffaele Giancarlo, Kunsoo Park |
O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Richard Cole 0001, Moshe Lewenstein |
Multidimensional matching and fast search in suffix trees. |
SODA |
2003 |
DBLP BibTeX RDF |
|
51 | Stefan Burkhardt, Juha Kärkkäinen |
Fast Lightweight Suffix Array Construction and Checking. |
CPM |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Juha Kärkkäinen, Peter Sanders 0001 |
Simple Linear Work Suffix Array Construction. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Giovanni Manzini, Paolo Ferragina |
Engineering a Lightweight Suffix Array Construction Algorithm. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu |
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. |
COCOON |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Dong Kyue Kim, Kunsoo Park |
Linear-Time Construction of Two-Dimensional Suffix Trees. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Kunihiko Sadakane |
A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. |
Data Compression Conference |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Wojciech Szpankowski |
(Un)expected Behavior of Typical Suffix Trees. |
SODA |
1992 |
DBLP BibTeX RDF |
|
48 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi |
Factor Oracles. |
CIAA |
2006 |
DBLP DOI BibTeX RDF |
factor oracle, suffix trie, graph quotient, string matching, suffix tree |
48 | Paolo Ferragina, Giovanni Manzini |
Indexing compressed text. |
J. ACM |
2005 |
DBLP DOI BibTeX RDF |
Lempel-Ziv compressor, full-text indexing, indexing data structure, suffix tree, suffix array, text compression, Burrows-Wheeler transform, pattern searching |
48 | Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi |
A Trie-Based Approach for Compacting Automata. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
factor and suffix automata, suffix tree, index, text compression, Automata and formal languages |
47 | Dimitris Tsirogiannis, Nick Koudas |
Suffix tree construction algorithms on modern hardware. |
EDBT |
2010 |
DBLP DOI BibTeX RDF |
multi-core, suffix tree |
47 | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton |
A new method for indexing genomes using on-disk suffix trees. |
CIKM |
2008 |
DBLP DOI BibTeX RDF |
DNA indexing, disk structures, suffix tree |