Search results for "suffix-tree"

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.	SPIRE	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.	Algorithmica	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.	IEEE Trans. Knowl. Data Eng.	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.	CPM	2005	DBLP DOI BibTeX RDF
139	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
132	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
130	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
120	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
116	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
114	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
114	Dong Kyue Kim, Junha Jo, Heejin Park	A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets.	WEA	2004	DBLP DOI BibTeX RDF
99	Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen	Engineering a Compressed Suffix Tree Implementation.	WEA	2007	DBLP DOI BibTeX RDF
89	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
87	Richard Cole 0001, Tsvi Kopelowitz, Moshe Lewenstein	Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.	ICALP (1)	2006	DBLP DOI BibTeX RDF
86	Tetsuo Shibuya	Prefix-Shuffled Geometric Suffix Tree.	SPIRE	2007	DBLP DOI BibTeX RDF
83	Hongwei Huo, Vojislav Stojkovic	A Suffix Tree Construction Algorithm for DNA Sequences.	BIBE	2007	DBLP DOI BibTeX RDF
82	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
80	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
80	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
80	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
79	Srikanta J. Bedathur, Jayant R. Haritsa	Engineering a Fast Online Persistent Suffix Tree Construction.	ICDE	2004	DBLP DOI BibTeX RDF
77	Shunsuke Inenaga, Masayuki Takeda	On-Line Linear-Time Construction of Word Suffix Trees.	CPM	2006	DBLP DOI BibTeX RDF
76	Paolo Ferragina, Roberto Grossi, Manuela Montangero	A Note on Updating Suffix Tree Labels.	CIAC	1997	DBLP DOI BibTeX RDF
76	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
75	Raphaël Clifford, Marek J. Sergot	Distributed and Paged Suffix Trees for Large Genetic Databases.	CPM	2003	DBLP DOI BibTeX RDF
75	Pang Ko, Srinivas Aluru	Space Efficient Linear Time Construction of Suffix Arrays.	CPM	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.	ATC	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.	WWW	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.	Mach. Learn.	2006	DBLP DOI BibTeX RDF	E-mail filtering, Text categorization, Spam, Suffix tree, Scoring function
74	Martin Senft	Compressed by the Suffix Tree.	DCC	2006	DBLP DOI BibTeX RDF
72	Tetsuo Shibuya	Constructing the Suffix Tree of a Tree with a Large Alphabet.	ISAAC	1999	DBLP DOI BibTeX RDF
72	Tetsuo Shibuya	Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures.	CPM	2006	DBLP DOI BibTeX RDF
72	Martin Farach, S. Muthukrishnan 0001	Optimal Logarithmic Time Randomized Suffix Tree Construction.	ICALP	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.	Algorithmica	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.	VLDB J.	2002	DBLP DOI BibTeX RDF	Suffix tree, Approximate matching, Database index, Biological sequence
66	Kunihiko Sadakane	Compressed Suffix Trees with Full Functionality.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
66	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
64	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
64	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
64	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
63	Jianhua Wang, Ruixu Li	A New Cluster Merging Algorithm of Suffix tree Clustering.	Intelligent Information Processing	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.	CPM	2008	DBLP DOI BibTeX RDF
63	Martin Senft	Suffix Tree Based Data Compression.	SOFSEM	2005	DBLP DOI BibTeX RDF
61	Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira	Fully-Compressed Suffix Trees.	LATIN	2008	DBLP DOI BibTeX RDF
61	Pang Ko, Srinivas Aluru	Obtaining Provably Good Performance from Suffix Trees in Secondary Storage.	CPM	2006	DBLP DOI BibTeX RDF
61	Choon Hui Teo, S. V. N. Vishwanathan	Fast and space efficient string kernels using suffix arrays.	ICML	2006	DBLP DOI BibTeX RDF
61	Dimitris Tsirogiannis, Nick Koudas	Suffix tree construction algorithms on modern hardware.	EDBT	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.	WABI	2002	DBLP DOI BibTeX RDF
57	Arne Andersson, N. Jesper Larsson, Kurt Swanson	Suffix Trees on Words.	Algorithmica	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.	DASFAA	2009	DBLP DOI BibTeX RDF
57	Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park	Linear-Time Construction of Suffix Arrays.	CPM	2003	DBLP DOI BibTeX RDF
55	Elena Zheleva, Abdullah N. Arslan	Fast Motif Search in Protein Sequence Databases.	CSR	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.	SPIRE	2009	DBLP DOI BibTeX RDF
55	Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane	Dynamic dictionary matching and compressed suffix trees.	SODA	2005	DBLP BibTeX RDF
54	Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein	Towards Real-Time Suffix Tree Construction.	SPIRE	2005	DBLP DOI BibTeX RDF
54	Tetsuo Shibuya	Generalization of a Suffix Tree for RNA Structural Pattern Matching.	SWAT	2000	DBLP DOI BibTeX RDF
52	Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz	Optimal Exact Strring Matching Based on Suffix Arrays.	SPIRE	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.	Multim. Tools Appl.	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.	RECOMB	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.	FOCS	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.	ISAAC	2008	DBLP DOI BibTeX RDF
50	Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira	Dynamic Fully-Compressed Suffix Trees.	CPM	2008	DBLP DOI BibTeX RDF
50	Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu	Approximate String Matching in DNA Sequences.	DASFAA	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.	Stringology	2008	DBLP BibTeX RDF
48	Juha Kärkkäinen	Suffix Cactus: A Cross between Suffix Tree and Suffix Array.	CPM	1995	DBLP DOI BibTeX RDF
46	Chunxi Chen, Bertil Schmidt	Parallel Construction of Large Suffix Trees on a PC Cluster.	Euro-Par	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.	New Gener. Comput.	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.	J. ACM	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.	AWIC	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.	CPM	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.	APSEC	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.	ACSC	2001	DBLP DOI BibTeX RDF
42	Y. Jiang, X. Ding, Z. Ren	A Suffix Tree Based Handwritten Chinese Address Recognition System.	ICDAR	2007	DBLP DOI BibTeX RDF
42	Gad M. Landau, Baruch Schieber, Uzi Vishkin	Parallel Construction of a Suffix Tree (Extended Abstract).	ICALP	1987	DBLP DOI BibTeX RDF
42	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
42	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
42	Olivier Y. de Vel	Learning Semi-Structured Document Categorization Using Bounded-Length Spectrum Sub-Sequence Kernels.	Data Min. Knowl. Discov.	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.	CIAA	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.	ISPA Workshops	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.	CPM	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.	LATIN	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.	Algorithmica	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.	COCOON	2005	DBLP DOI BibTeX RDF
41	Wing-Kai Hon, Kunihiko Sadakane	Space-Economical Algorithms for Finding Maximal Unique Matches.	CPM	2002	DBLP DOI BibTeX RDF
41	Dong Kyue Kim, Kunsoo Park	Linear-Time Construction of Two-Dimensional Suffix Trees.	ICALP	1999	DBLP DOI BibTeX RDF
41	Massimiliano Ruocco, Heri Ramampiaro	Event Clusters Detection on Flickr Images Using a Suffix-Tree Structure.	ISM	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.	SERA	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.	ICML	2006	DBLP DOI BibTeX RDF
39	Tatiana Starikovskaya, Hjalte Wedel Vildhøj	A suffix tree or not a suffix tree?	J. Discrete Algorithms	2015	DBLP DOI BibTeX RDF
39	Tatiana Starikovskaya, Hjalte Wedel Vildhøj	A Suffix Tree Or Not A Suffix Tree?	CoRR	2014	DBLP BibTeX RDF
39	Tatiana Starikovskaya, Hjalte Wedel Vildhøj	A Suffix Tree Or Not a Suffix Tree?	IWOCA	2014	DBLP DOI BibTeX RDF
39	Jinuk Bae, Sukho Lee	Estimating the Number of Substring Matches in Long String Databases.	APWeb	2005	DBLP DOI BibTeX RDF
39	Richard Cole 0001, Moshe Lewenstein	Multidimensional matching and fast search in suffix trees.	SODA	2003	DBLP BibTeX RDF
39	Juha Kärkkäinen, Peter Sanders 0001	Simple Linear Work Suffix Array Construction.	ICALP	2003	DBLP DOI BibTeX RDF
39	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
39	Wojciech Szpankowski	(Un)expected Behavior of Typical Suffix Trees.	SODA	1992	DBLP BibTeX RDF
37	Abdullah N. Arslan	Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.	LATIN	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.	ICIT	2007	DBLP DOI BibTeX RDF
34	Taehyung Lee, Joong Chae Na, Kunsoo Park	On-Line Construction of Parameterized Suffix Trees.	SPIRE	2009	DBLP DOI BibTeX RDF
34	Sudha Balla, Sanguthevar Rajasekaran	Space and Time Efficient Algorithms to Discover Endogenous RNAi Patterns in Complete Genome Data.	ISBRA	2007	DBLP DOI BibTeX RDF