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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004, Proceedings, pp. 138-149, 2004, Springer, 3-540-23210-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(3), pp. 350-377, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(1), pp. 90-105, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(6), pp. 987-1011, 2000. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 33-44, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
124 | Dong Kyue Kim, Junha Jo, Heejin Park |
A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 301-314, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
111 | Dror Baron, Yoram Bresler |
Antisequential Suffix Sorting for BWT-Based Data Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 54(4), pp. 385-397, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 14(3), pp. 281-299, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 358-369, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
102 | Amol Ghoting, Konstantin Makarychev |
Serial and parallel methods for i/o efficient suffix tree construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, Providence, Rhode Island, USA, June 29 - July 2, 2009, pp. 827-840, 2009, ACM, 978-1-60558-551-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 661-672, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 39(1), pp. 1-19, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 1.2:1-1.2:23, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 39(2), pp. 4, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Beijing, China, June 12-14, 2007, pp. 833-844, 2007, ACM, 978-1-59593-686-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(6), pp. 918-936, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(3), pp. 233-241, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 60-71, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
87 | Pang Ko, Srinivas Aluru |
Space Efficient Linear Time Construction of Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 200-210, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
84 | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton |
Suffix trees for very large genomic sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 1417-1420, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
suffix tree, external memory algorithms |
84 | Joong Chae Na, Kunsoo Park |
Data Compression with Truncated Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: Data Compression Conference, DCC 2000, Snowbird, Utah, USA, March 28-30, 2000., pp. 565, 2000, IEEE Computer Society, 0-7695-0592-9. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Ziv-Lempel coding, LZ77, data compression, suffix tree, sliding window |
78 | Kunihiko Sadakane |
Compressed Suffix Trees with Full Functionality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 589-607, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 23rd International Conference on Data Engineering, ICDE 2007, The Marmara Hotel, Istanbul, Turkey, April 15-20, 2007, pp. 1350-1354, 2007, IEEE Computer Society, 1-4244-0802-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
78 | Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen |
Engineering a Compressed Suffix Tree Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings, pp. 217-228, 2007, Springer, 978-3-540-72844-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
78 | Klaus-Bernd Schürmann, Jens Stoye |
Counting Suffix Arrays and Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings, pp. 55-66, 2005, Springer, 3-540-29740-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
78 | Veli Mäkinen, Gonzalo Navarro 0001 |
Compressed Compact Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 420-433, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
78 | Raphaël Clifford, Marek J. Sergot |
Distributed and Paged Suffix Trees for Large Genetic Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 70-82, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
78 | Veli Mäkinen |
Trade Off Between Compression and Search Times in Compact Suffix Array. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers, pp. 189-201, 2001, Springer, 3-540-42560-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
75 | Feng Shao, Gang Chen 0001, Jinxiang Dong |
Accelerating XML Structural Matching Using Suffix Bitmaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (1) ![In: Computational Science - ICCS 2007, 7th International Conference Beijing, China, May 27-30, 2007, Proceedings, Part I, pp. 253-260, 2007, Springer, 978-3-540-72583-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Suffix Bitmap, XML, Filtering, Structural Matching |
75 | Arne Andersson, N. Jesper Larsson, Kurt Swanson |
Suffix Trees on Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 23(3), pp. 246-260, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 251-260, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
71 | Giovanni Manzini, Paolo Ferragina |
Engineering a Lightweight Suffix Array Construction Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 33-50, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 14th International Conference, DASFAA 2009, Brisbane, Australia, April 21-23, 2009. Proceedings, pp. 730-744, 2009, Springer, 978-3-642-00886-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
69 | Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira |
Fully-Compressed Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 362-373, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
69 | Hongwei Huo, Vojislav Stojkovic |
A Suffix Tree Construction Algorithm for DNA Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBE ![In: Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2007, October 14-17, 2007, Harvard Medical School, Boston, MA, USA, pp. 1178-1182, 2007, IEEE Computer Society, 978-1-4244-1509-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Tetsuo Shibuya |
Prefix-Shuffled Geometric Suffix Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 14th International Symposium, SPIRE 2007, Santiago, Chile, October 29-31, 2007, Proceedings, pp. 300-309, 2007, Springer, 978-3-540-75529-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Pang Ko, Srinivas Aluru |
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 72-83, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Choon Hui Teo, S. V. N. Vishwanathan |
Fast and space efficient string kernels using suffix arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006, pp. 929-936, 2006, ACM, 1-59593-383-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
69 | Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park |
Linear-Time Construction of Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 186-199, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
69 | Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch |
The Enhanced Suffix Array and Its Applications to Genome Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 449-463, 2002, Springer, 3-540-44211-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
66 | Gang Chen, Simon J. Puglisi, William F. Smyth |
Lempel-Ziv Factorization Using Less Time & Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 1(4), pp. 605-623, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(2), pp. 236-280, 1999. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 12, pp. 3.4:1-3.4:24, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE/CRIWG ![In: Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999, pp. 81-88, 1999, IEEE Computer Society, 0-7695-0268-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
string processing, indexing, sorting, suffix array, text search |
65 | Martin Farach |
Optimal Suffix Tree Construction with Large Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 137-143, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Speech Audio Process. ![In: IEEE Trans. Speech Audio Process. 17(5), pp. 956-965, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
62 | Martin Fiala, Jan Holub 0001 |
DCA Using Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2008 Data Compression Conference (DCC 2008), 25-27 March 2008, Snowbird, UT, USA, pp. 516, 2008, IEEE Computer Society, 978-0-7695-3121-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 326-338, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(2), pp. 21, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 11(3), pp. 256-271, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, Saariselkä, Finland, August 25-27, 2009, Proceedings, pp. 51-62, 2009, Springer, 978-3-642-03783-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira |
Dynamic Fully-Compressed Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings, pp. 191-203, 2008, Springer, 978-3-540-69066-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Paolo Ferragina, Johannes Fischer 0001 |
Suffix Arrays on Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings, pp. 328-339, 2007, Springer, 978-3-540-73436-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
60 | Gianni Franceschini, S. Muthukrishnan 0001 |
Optimal suffix selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 328-337, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings, pp. 84-93, 2006, Springer, 3-540-35455-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Simon J. Puglisi, William F. Smyth, Andrew Turpin |
Suffix arrays: what are they good for? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADC ![In: Database Technologies 2006, Proceedings of the 17th Australasian Database Conference, ADC 2006, Hobart, Tasmania, Australia, January 16-19 2006, pp. 17-18, 2006, Australian Computer Society, 1-920682-31-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
60 | Martin Senft |
Compressed by the Suffix Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2006 Data Compression Conference (DCC 2006), 28-30 March 2006, Snowbird, UT, USA, pp. 183-192, 2006, IEEE Computer Society, 0-7695-2545-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane |
Dynamic dictionary matching and compressed suffix trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 13-22, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
60 | Jeong Seop Sim |
Time and Space Efficient Search for Small Alphabets with Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fuzzy Systems and Knowledge Discovery, Second International Conference, FSKD 2005, Changsha, China, August 27-29, 2005, Proceedings, Part I, pp. 1102-1107, 2005, Springer, 3-540-28312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
60 | Srikanta J. Bedathur, Jayant R. Haritsa |
Engineering a Fast Online Persistent Suffix Tree Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 20th International Conference on Data Engineering, ICDE 2004, 30 March - 2 April 2004, Boston, MA, USA, pp. 720-731, 2004, IEEE Computer Society, 0-7695-2065-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
60 | Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz |
Optimal Exact Strring Matching Based on Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings, pp. 31-43, 2002, Springer, 3-540-44158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
60 | Veli Mäkinen |
Compact Suffix Array. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings, pp. 305-319, 2000, Springer, 3-540-67633-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
60 | Paolo Ferragina, Roberto Grossi, Manuela Montangero |
A Note on Updating Suffix Tree Labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings, pp. 181-192, 1997, Springer, 3-540-62592-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
60 | Martin Farach, S. Muthukrishnan 0001 |
Optimal Logarithmic Time Randomized Suffix Tree Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 550-561, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
58 | Donald A. Adjeroh, Fei Nan |
Suffix Sorting via Shannon-Fano-Elias Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2008 Data Compression Conference (DCC 2008), 25-27 March 2008, Snowbird, UT, USA, pp. 502, 2008, IEEE Computer Society, 978-0-7695-3121-2. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 631-637, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009, pp. 305-314, 2009, ACM, 978-1-60558-512-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATC ![In: Autonomic and Trusted Computing, 5th International Conference, ATC 2008, Oslo, Norway, June 23-25, 2008, Proceedings, pp. 540-554, 2008, Springer, 978-3-540-69294-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007, pp. 121-130, 2007, ACM, 978-1-59593-654-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 65(1), pp. 309-338, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 44st Annual Southeast Regional Conference, 2006, Melbourne, Florida, USA, March 10-12, 2006, pp. 679-684, 2006, ACM, 1-59593-315-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 13th Annual International Conference, RECOMB 2009, Tucson, AZ, USA, May 18-21, 2009. Proceedings, pp. 121-137, 2009, Springer, 978-3-642-02007-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAI ![In: Algebraic Informatics, Third International Conference, CAI 2009, Thessaloniki, Greece, May 19-22, 2009, Proceedings, pp. 250-259, 2009, Springer, 978-3-642-03563-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 41-53, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Roberto Grossi |
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 39-40, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Johannes Fischer 0001, Veli Mäkinen, Gonzalo Navarro 0001 |
An(other) Entropy-Bounded Compressed Suffix Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 19th Annual Symposium, CPM 2008, Pisa, Italy, June 18-20, 2008, Proceedings, pp. 152-165, 2008, Springer, 978-3-540-69066-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Maxim A. Babenko, Tatiana Starikovskaya |
Computing Longest Common Substrings Via Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings, pp. 64-75, 2008, Springer, 978-3-540-79708-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
51 | Heikki Hyyrö |
An Efficient Linear Space Algorithm for Consecutive Suffix Alignment under Edit Distance (Short Preliminary Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings, pp. 155-163, 2008, Springer, 978-3-540-89096-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 48(2), pp. 173-186, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 48(1), pp. 23-36, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Gianni Franceschini, S. Muthukrishnan 0001 |
In-Place Suffix Sorting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 533-545, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
51 | Ge Nong, Sen Zhang |
Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 613-624, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 13th Asia-Pacific Software Engineering Conference (APSEC 2006), 6-8 December 2006, Bangalore, India, pp. 269-276, 2006, IEEE Computer Society, 0-7695-2685-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
51 | Srikanta J. Bedathur, Jayant R. Haritsa |
Search-Optimized Suffix-Tree Storage for Biological Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2005, 12th International Conference, Goa, India, December 18-21, 2005, Proceedings, pp. 29-39, 2005, Springer, 3-540-30936-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Chunxi Chen, Bertil Schmidt |
Parallel Construction of Large Suffix Trees on a PC Cluster. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings, pp. 1227-1236, 2005, Springer, 3-540-28700-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Martin Senft |
Suffix Tree Based Data Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, pp. 350-359, 2005, Springer, 3-540-24302-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 273-282, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
51 | Richard Cole 0001, Moshe Lewenstein |
Multidimensional matching and fast search in suffix trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 851-852, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
51 | Stefan Burkhardt, Juha Kärkkäinen |
Fast Lightweight Suffix Array Construction and Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 55-69, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Juha Kärkkäinen, Peter Sanders 0001 |
Simple Linear Work Suffix Array Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 943-955, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Giovanni Manzini, Paolo Ferragina |
Engineering a Lightweight Suffix Array Construction Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 698-710, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 401-410, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Dong Kyue Kim, Kunsoo Park |
Linear-Time Construction of Two-Dimensional Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 463-472, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Kunihiko Sadakane |
A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: Data Compression Conference, DCC 1999, Snowbird, Utah, USA, March 29-31, 1999., pp. 548, 1999, IEEE Computer Society, 0-7695-0096-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Wojciech Szpankowski |
(Un)expected Behavior of Typical Suffix Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA., pp. 422-431, 1992, ACM/SIAM, 0-89791-466-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
48 | Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi |
Factor Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings, pp. 78-89, 2006, Springer, 3-540-37213-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
factor oracle, suffix trie, graph quotient, string matching, suffix tree |
48 | Paolo Ferragina, Giovanni Manzini |
Indexing compressed text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(4), pp. 552-581, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 145-158, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, March 22-26, 2010, Proceedings, pp. 263-274, 2010, ACM, 978-1-60558-945-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 649-658, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
DNA indexing, disk structures, suffix tree |