|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 307 occurrences of 172 keywords
|
|
|
Results
Found 418 publication records. Showing 418 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
248 | 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 |
|
228 | 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 |
164 | 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 |
142 | 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 |
|
139 | 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 |
132 | 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 |
130 | 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 |
120 | 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 |
|
116 | 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 |
114 | 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 |
114 | 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 |
|
99 | 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 |
|
89 | 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 |
87 | 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 |
|
86 | 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 |
|
83 | 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 |
|
82 | 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 |
80 | 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 |
80 | 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 |
80 | 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 |
|
79 | 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 |
|
77 | 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 |
|
76 | 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 |
|
76 | 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 |
75 | 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 |
|
75 | 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 |
|
75 | 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 |
75 | 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 |
75 | 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 |
74 | 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 |
|
72 | Tetsuo Shibuya |
Constructing the Suffix Tree of a Tree with a Large Alphabet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 225-236, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
72 | 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 |
|
72 | 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 |
|
71 | 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 |
71 | 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 |
66 | 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 |
|
66 | 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 |
64 | 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 |
64 | 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 |
64 | 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 |
63 | Jianhua Wang, Ruixu Li |
A New Cluster Merging Algorithm of Suffix tree Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Intelligent Information Processing ![In: Intelligent Information Processing III, IFIP TC12 International Conference on Intelligent Information Processing (IIP 2006), September 20-23, Adelaide, Australia, pp. 197-203, 2006, Springer, 978-0-387-44639-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
suffix tree clustering, cluster merging algorithm |
63 | 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 |
|
63 | 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 |
|
61 | 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 |
|
61 | 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 |
|
61 | 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 |
|
61 | 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 |
59 | 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 |
|
57 | 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 |
57 | 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 |
|
57 | 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 |
|
55 | Elena Zheleva, Abdullah N. Arslan |
Fast Motif Search in Protein Sequence Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 670-681, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
motif search, PROSITE pattern, heuristic, suffix tree, preprocessing, regular expression matching |
55 | 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 |
|
55 | 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 |
|
54 | Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein |
Towards Real-Time Suffix Tree Construction. ![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. 67-78, 2005, Springer, 3-540-29740-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
54 | Tetsuo Shibuya |
Generalization of a Suffix Tree for RNA Structural Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 393-406, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
52 | 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 |
|
52 | Yu-lung Lo, Wen-Ling Lee, Lin-Huang Chang |
True suffix tree approach for discovering non-trivial repeating patterns in a music object. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 37(2), pp. 169-187, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Non-trivial repeating pattern, Multimedia databases, Suffix tree, Context-based retrieval, Music databases |
52 | Laurent Marsan, Marie-France Sagot |
Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, RECOMB 2000, Tokyo, Japan, April 8-11, 2000, pp. 210-219, 2000, ACM, 1-58113-186-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
motif extraction, model, consensus, suffix tree, promoter, structured motif |
51 | Martin Farach, Paolo Ferragina, S. Muthukrishnan 0001 |
Overcoming the Memory Bottleneck in Suffix Tree Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 174-185, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
External-Memory Computation, Data Structures, String Matching, Models of Computation |
50 | Simon J. Puglisi, Andrew Turpin |
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 124-135, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
50 | 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 |
|
50 | Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu |
Approximate String Matching in DNA Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Eighth International Conference on Database Systems for Advanced Applications (DASFAA '03), March 26-28, 2003, Kyoto, Japan, pp. 303-310, 2003, IEEE Computer Society, 0-7695-1895-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Jie Lin, Yue Jiang 0001, Donald A. Adjeroh |
The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees and Suffix Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stringology ![In: Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008, pp. 68-83, 2008, Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, 978-80-01-04145-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
48 | Juha Kärkkäinen |
Suffix Cactus: A Cross between Suffix Tree and Suffix Array. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings, pp. 191-204, 1995, Springer, 3-540-60044-2. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
46 | 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 |
|
44 | Stefano Lonardi, Jessica Lin 0001, Eamonn J. Keogh, Bill Yuan-chi Chiu |
Efficient Discovery of Unusual Patterns in Time Series. ![Search on Bibsonomy](Pics/bibsonomy.png) |
New Gener. Comput. ![In: New Gener. Comput. 25(1), pp. 61-93, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Feature Extraction, Anomaly Detection, Time Series, Markov Model, Suffix Tree, Novelty Detection |
44 | Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino |
Boosting textual compression in optimal linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(4), pp. 688-713, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Lempel-Ziv compressors, empirical entropy, suffix tree, Arithmetic coding, Huffman coding, text compression, Burrows-Wheeler transform |
44 | Jerzy Stefanowski, Dawid Weiss |
Carrot and Language Properties in Web Search Results Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AWIC ![In: Web Intelligence, First International Atlantic Web Intelligence Conference, AWIC 2003, Madrid, Spain, May 5-6, 2003, Proceedings, pp. 240-249, 2003, Springer, 3-540-40124-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
web browsing and exploration, web search clustering, suffix tree clustering, information retrieval |
43 | 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 |
|
43 | 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 |
|
43 | Krisztián Monostori, Arkady B. Zaslavsky, Heinz W. Schmidt |
Efficiency of Data Structures for Detecting Overlaps in Digital Documents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSC ![In: 24th Australasian Computer Science Conference (ACSC 2001), 29 January - 1 February 2001, Gold Coast, Queensland, Australia, pp. 140-147, 2001, IEEE Computer Society, 0-7695-0963-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Y. Jiang, X. Ding, Z. Ren |
A Suffix Tree Based Handwritten Chinese Address Recognition System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 9th International Conference on Document Analysis and Recognition (ICDAR 2007), 23-26 September, Curitiba, Paraná, Brazil, pp. 292-296, 2007, IEEE Computer Society, 978-0-7695-2822-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Gad M. Landau, Baruch Schieber, Uzi Vishkin |
Parallel Construction of a Suffix Tree (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings, pp. 314-325, 1987, Springer, 3-540-18088-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
42 | 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 |
42 | 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 |
42 | Olivier Y. de Vel |
Learning Semi-Structured Document Categorization Using Bounded-Length Spectrum Sub-Sequence Kernels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Min. Knowl. Discov. ![In: Data Min. Knowl. Discov. 13(3), pp. 309-334, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded-length spectrum, support vector machines, kernel, suffix tree, digital forensics, computer forensics, document categorization, Naive Bayes classifier |
42 | 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 |
42 | Mario Cannataro, Pierangelo Veltri |
A Grid Service Based on Suffix Trees for Pattern Extraction from Mass Spectrometry Proteomics Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings, pp. 658-667, 2006, Springer, 3-540-49860-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Suffix Tree, Grid Services, Mass Spectrometry, Pattern Extraction |
42 | 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 |
42 | Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed 0001, Marie-France Sagot |
Longest Repeats with a Block of Don't Cares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 271-278, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Repeat Extraction, Dont Care, Efficient Merging, Suffix Tree, String, Combinatorial Problems, Lowest Common Ancestor |
41 | 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 |
|
41 | 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 |
|
41 | Wing-Kai Hon, Kunihiko Sadakane |
Space-Economical Algorithms for Finding Maximal Unique Matches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, pp. 144-152, 2002, Springer, 3-540-43862-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
41 | 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 |
|
41 | Massimiliano Ruocco, Heri Ramampiaro |
Event Clusters Detection on Flickr Images Using a Suffix-Tree Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISM ![In: 12th IEEE International Symposium on Multimedia, ISM 2010, Taichung, Taiwan, December 13-15, 2010, pp. 41-48, 2010, IEEE Computer Society, 978-1-4244-8672-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Event Clustering, Image Annotation, Event Detection, Suffix Tree, Image Clustering |
41 | Feng Zhang, Xinjun Wang, Shaolong Ma |
Temporal XML Indexing Based on Suffix Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SERA ![In: Proceedings of the Seventh ACIS International Conference on Software Engineering Research, Management and Applications, SERA 2009, Haikou, China, 2-4 December 2009, pp. 140-144, 2009, IEEE Computer Society, 978-0-7695-3903-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Temporal XML, indexing, suffix tree |
40 | Michael P. Holmes, Charles Lee Isbell Jr. |
Looping suffix tree-based inference of partially observable hidden state. ![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. 409-416, 2006, ACM, 1-59593-383-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Tatiana Starikovskaya, Hjalte Wedel Vildhøj |
A suffix tree or not a suffix tree? ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 32, pp. 14-23, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
39 | Tatiana Starikovskaya, Hjalte Wedel Vildhøj |
A Suffix Tree Or Not A Suffix Tree? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1403.1364, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
39 | Tatiana Starikovskaya, Hjalte Wedel Vildhøj |
A Suffix Tree Or Not a Suffix Tree? ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers, pp. 338-350, 2014, Springer, 978-3-319-19314-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
39 | Jinuk Bae, Sukho Lee |
Estimating the Number of Substring Matches in Long String Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Web Technologies Research and Development - APWeb 2005, 7th Asia-Pacific Web Conference, Shanghai, China, March 29 - April 1, 2005, Proceedings, pp. 145-156, 2005, Springer, 3-540-25207-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | 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 |
|
39 | 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 |
|
39 | 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 |
39 | 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 |
|
37 | Abdullah N. Arslan |
Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 118-129, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
d-query, approximate dictionary look-up, space efficient algorithm, suffix tree, edit distance, preprocessing, Hamming distance |
35 | Anjali Mohapatra, P. M. Mishra, S. Padhy |
Motif Search in DNA Sequences Using Generalized Suffix Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIT ![In: 10th International Conference on Information Technology, ICIT 2007, Roukela, India, 17-20 December 2007, pp. 100-103, 2007, IEEE Computer Society, 0-7695-3068-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Taehyung Lee, Joong Chae Na, Kunsoo Park |
On-Line Construction of Parameterized Suffix Trees. ![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. 31-38, 2009, Springer, 978-3-642-03783-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Sudha Balla, Sanguthevar Rajasekaran |
Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBRA ![In: Bioinformatics Research and Applications, Third International Symposium, ISBRA 2007, Atlanta, GA, USA, May 7-10, 2007, Proceedings, pp. 260-269, 2007, Springer, 978-3-540-72030-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 418 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ >>] |
|