Search results for "suffix-tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa	Compact Directed Acyclic Word Graphs for a Sliding Window.	SPIRE	2002	DBLP DOI BibTeX RDF
34	Laurentius Leonard, Ken Tanaka	Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems.	CoRR	2022	DBLP DOI BibTeX RDF
34	Kimmo Fredriksson	From Nondeterministic Suffix Automaton to Lazy Suffix Tree.	Algorithms and Applications	2010	DBLP DOI BibTeX RDF
34	Richard Cole 0001, Ramesh Hariharan	Faster Suffix Tree Construction with Missing Suffix Links.	SIAM J. Comput.	2003	DBLP DOI BibTeX RDF
34	Krisztián Monostori, Arkady B. Zaslavsky, István Vajk	Suffix Vector: A Space-Efficient Suffix Tree Representation.	ISAAC	2001	DBLP DOI BibTeX RDF
34	Richard Cole 0001, Ramesh Hariharan	Faster suffix tree construction with missing suffix links.	STOC	2000	DBLP DOI BibTeX RDF
33	Takuya Kida	Suffix Tree Based VF-Coding for Compressed Pattern Matching.	DCC	2009	DBLP DOI BibTeX RDF
33	Jingyi Yang, Jitender S. Deogun	G Protein-Coupled Receptor Classification at the Subfamily Level with Probabilistic Suffix Tree.	CIBCB	2006	DBLP DOI BibTeX RDF
33	Marie-France Sagot	Spelling Approximate Repeated or Common Motifs Using a Suffix Tree.	LATIN	1998	DBLP DOI BibTeX RDF
33	Mihail Halachev, Nematollaah Shiri	Fast Structured Motif Search in DNA Sequences.	BIRD	2008	DBLP DOI BibTeX RDF	performance, suffix tree, DNA sequences, structured motif
33	Chen Na Lian, Mihail Halachev, Nematollaah Shiri	Searching for Supermaximal Repeats in Large DNA Sequences.	BIRD	2008	DBLP DOI BibTeX RDF	supermaximal repeats, performance, suffix tree, DNA sequences
33	Daniel Zeng 0001, Donghua Wei, Michael Chau, Fei-Yue Wang 0001	Chinese Word Segmentation for Terrorism-Related Contents.	ISI Workshops	2008	DBLP DOI BibTeX RDF	Ukkonen algorithm, Lidstone flatness, Mutual information, suffix tree, N-gram, Heuristic rules
33	Zhijie Ban, Zhimin Gu, Yu Jin 0003	An online PPM prediction model for web prefetching.	WIDM	2007	DBLP DOI BibTeX RDF	noncompact suffix tree, entropy, PPM, web prefetching
33	Dell Zhang, Wee Sun Lee	Extracting key-substring-group features for text classification.	KDD	2006	DBLP DOI BibTeX RDF	machine learning, feature extraction, text mining, text classification, suffix tree
33	Alexandra M. Carvalho, Arlindo L. Oliveira, Ana T. Freitas, Marie-France Sagot	A parallel algorithm for the extraction of structured motifs.	SAC	2004	DBLP DOI BibTeX RDF	parallel algorithm, grid computing, bioinformatics, suffix tree, structured motifs
33	Sanghyun Park 0003, Wesley W. Chu, Jeehee Yoon, Chih-Cheng Hsu	Efficient Searches for Similar Subsequences of Different Lengths in Sequence Databases.	ICDE	2000	DBLP DOI BibTeX RDF	Similarity Search, Suffix Tree, Time Warping, Sequence Database
33	Krisztián Monostori, Arkady B. Zaslavsky, Heinz W. Schmidt	Document overlap detection system for distributed digital libraries.	ACM DL	2000	DBLP DOI BibTeX RDF	overlap detection, distributed system, string-matching, suffix tree
32	Jiong Yang 0001, Wei Wang 0010, Philip S. Yu	BASS: Approximate Search on Large String Databases.	SSDBM	2004	DBLP DOI BibTeX RDF
32	Robert Tairas, Jeff Gray 0001	Phoenix-based clone detection using suffix trees.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	suffix trees, clone detection, software analysis, code clones
32	Shunsuke Inenaga, Masayuki Takeda	Sparse Directed Acyclic Word Graphs.	SPIRE	2006	DBLP DOI BibTeX RDF
32	Wojciech Rytter	The Structure of Subword Graphs and Suffix Trees of Fibonacci Words.	CIAA	2005	DBLP DOI BibTeX RDF
32	Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa	Efficient Discovery of Proximity Patterns with Suffix Arrays.	CPM	2001	DBLP DOI BibTeX RDF
31		Compressed Suffix Tree.	Encyclopedia of Database Systems	2009	DBLP DOI BibTeX RDF
31	Hai Zhuge, Liang Feng	Distributed Suffix Tree Overlay for Peer-to-Peer Search.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF
31	Maria Federico, Nadia Pisanti	Suffix Tree Characterization of Maximal Motifs in Biological Sequences.	BIRD	2008	DBLP DOI BibTeX RDF	Maximal Motifs, Suffix trees, Biological Sequences
31	Luke O'Connor, Tim Snider	Suffix Tree and String Complexity.	EUROCRYPT	1992	DBLP DOI BibTeX RDF
30	Christie I. Ezeife, Kashif Saeed, Dan Zhang	Mining very long sequences in large databases with PLWAPLong.	IDEAS	2009	DBLP DOI BibTeX RDF	PLWAP mining, long sequences, data mining, association rule mining
30	J. Ian Munro	Lower Bounds for Succinct Data Structures.	CPM	2008	DBLP DOI BibTeX RDF
30	Gang Chen, Simon J. Puglisi, William F. Smyth	Fast and Practical Algorithms for Computing All the Runs in a String.	CPM	2007	DBLP DOI BibTeX RDF
30	Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park	A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.	CPM	2007	DBLP DOI BibTeX RDF
30	Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	Efficient Computation of Substring Equivalence Classes with Suffix Arrays.	CPM	2007	DBLP DOI BibTeX RDF
30	Hamid Abdul Basit, Simon J. Puglisi, William F. Smyth, Andrew Turpin, Stan Jarzabek	Efficient token based clone detection with flexible tokenization.	ESEC/SIGSOFT FSE	2007	DBLP DOI BibTeX RDF	token-based clone detection, reverse engineering, software maintenance, clone detection
30	Naresh Neelapala, Romil Mittal, Jayant R. Haritsa	SPINE: Putting Backbone into String Indexing.	ICDE	2004	DBLP DOI BibTeX RDF
30	Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu	Compressed Index for Dynamic Text.	Data Compression Conference	2004	DBLP DOI BibTeX RDF
30	Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park	Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications.	CPM	2001	DBLP DOI BibTeX RDF
30	Yossi Matias, S. Muthukrishnan 0001, Süleyman Cenk Sahinalp, Jacob Ziv	Augmenting Suffix Trees, with Applications.	ESA	1998	DBLP DOI BibTeX RDF
27	Amol Ghoting, Konstantin Makarychev	Indexing genomic sequences on the IBM Blue Gene.	SC	2009	DBLP DOI BibTeX RDF
27	S. Rao Kosaraju	Balanced Suffix Trees (Invited Lecture).	CPM	2001	DBLP DOI BibTeX RDF
25	Jiong Yang 0001, Wei Wang 0010, Yi Xia, Philip S. Yu	Accelerating Approximate Subsequence Search on Large Protein Sequence Databases.	CSB	2002	DBLP DOI BibTeX RDF
25	Sanghyun Park, Wesley W. Chu	Discovering and Matching Elastic Rules from Sequence Databases.	ISMIS	2000	DBLP DOI BibTeX RDF
25	Julian Shun, Guy E. Blelloch	A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction.	ACM Trans. Parallel Comput.	2014	DBLP DOI BibTeX RDF
25	Guy E. Blelloch, Julian Shun	A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.	ALENEX	2011	DBLP DOI BibTeX RDF
25	Tetsuo Shibuya	Constructing the Suffix Tree of a Tree with a Large Alphabet.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2003	DBLP BibTeX RDF
25	Dany Breslauer	The Suffix Tree of a Tree and Minimizing Sequential Transducers.	Theor. Comput. Sci.	1998	DBLP DOI BibTeX RDF
25	Dany Breslauer	The suffix Tree of a Tree and Minimizing Sequential Transducers.	CPM	1996	DBLP DOI BibTeX RDF
23	Jinlin Chen, Terry Cook	Mining contiguous sequential patterns from web logs.	WWW	2007	DBLP DOI BibTeX RDF	contiguous sequential pattern, web usage mining, sequential pattern
23	Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. H. Tung	The ed-tree: An Index for Large DNA Sequence Databases.	SSDBM	2003	DBLP DOI BibTeX RDF
23	Wing-Kai Hon, Rahul Shah 0001, Shih-Bin Wu	Efficient Index for Retrieving Top-k Most Frequent Documents.	SPIRE	2009	DBLP DOI BibTeX RDF
23	Hung Chim, Xiaotie Deng	Efficient Phrase-Based Document Similarity for Clustering.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF
23	Yuanfeng Wen, Faen Zhang, Beihong Jin	A Novel Distributed Index Approach for Service Discovery in MANETs.	ICPADS	2008	DBLP DOI BibTeX RDF
23	Jongkol Janruang, Worapoj Kreesuradej	A New Web Search Result Clustering based on True Common Phrase Label Discovery.	CIMCA/IAWTIC	2006	DBLP DOI BibTeX RDF
23	Alexandre H. L. Porto, Valmir Carneiro Barbosa	Multiple Sequence Alignment Based on Set Covers.	EvoWorkshops	2006	DBLP DOI BibTeX RDF	Set covers, Multiple sequence alignment
23	Luca Bortolussi, Francesco Fabris, Alberto Policriti	BuST-Bundled Suffix Trees.	IFIP TCS	2006	DBLP DOI BibTeX RDF
23	Lifeng Jia, Chunguang Zhou, Zhe Wang 0007, Xiujuan Xu	SuffixMiner: Efficiently Mining Frequent Itemsets in Data Streams by Suffix-Forest.	FSKD (2)	2005	DBLP DOI BibTeX RDF
23	Jung-Im Won, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim	A Novel Indexing Method for Efficient Sequence Matching in Large DNA Database Environment.	PAKDD	2005	DBLP DOI BibTeX RDF	DNA databases, DNA sequence matching, indexing
23	Zhaohui Sun, Jingyi Yang, Jitender S. Deogun	MISAE: A New Approach for Regulatory Motif Extraction.	CSB	2004	DBLP DOI BibTeX RDF
23	Jiong Yang 0001, Wei Wang 0010	CLUSEQ: Efficient and Effective Sequence Clustering.	ICDE	2003	DBLP DOI BibTeX RDF
23	Gerth Stølting Brodal, Christian N. S. Pedersen	Finding Maximal Quasiperiodicities in Strings.	CPM	2000	DBLP DOI BibTeX RDF
23	Ying Choi, Tak Wah Lam	Two-Dimensional Dynamic Dictionary Matching.	ISAAC	1996	DBLP DOI BibTeX RDF
23	P. Krishnan, Jeffrey Scott Vitter, Balakrishna R. Iyer	Estimating Alphanumeric Selectivity in the Presence of Wildcards.	SIGMOD Conference	1996	DBLP DOI BibTeX RDF
23	Robert Giegerich, Stefan Kurtz	Suffix Trees in the Functional Programming Paradigm.	ESOP	1994	DBLP DOI BibTeX RDF
21	Costas S. Iliopoulos, M. Sohel Rahman	Indexing Factors with Gaps.	Algorithmica	2009	DBLP DOI BibTeX RDF	String index, Gapped-factor, Algorithms, Data structure, Suffix tree
21	Stefan Schäckeler, Weijia Shang	Procedural Abstraction with Reverse Prefix Trees.	CGO	2009	DBLP DOI BibTeX RDF	post-pass optimization, reverse prefix tree, embedded systems, suffix tree, program visualization, code size reduction, code compaction, procedural abstraction
21	Bin Zhou 0002, Daxin Jiang, Jian Pei, Hang Li	OLAP on search logs: an infrastructure supporting data-driven applications in search engines.	KDD	2009	DBLP DOI BibTeX RDF	query session, OLAP, suffix tree, search log
21	Amihood Amir, Igor Nor	Real-time indexing over fixed finite alphabets.	SODA	2008	DBLP BibTeX RDF	quasi real time, real time, pattern matching, suffix tree
21	Guido Sautter, Cristina Abba, Klemens Böhm	Improved count suffix trees for natural language data.	IDEAS	2008	DBLP DOI BibTeX RDF	count suffix tree, query optimization, pruning, selectivity estimation, text data
21	Todd J. Treangen, Xavier Messeguer	Novel Computational Methods for Large Scale Genome Comparison.	IWPACBB	2008	DBLP DOI BibTeX RDF	genome alignment, interspersed repeats, DNA uptake sequences, homologous recombination, Hidden Markov Model, suffix tree, Comparative genomics
21	Hasan Ogul, Ü. Erkan Mumcuoglu	Subcellular Localization Prediction with New Protein Encoding Schemes.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	n{hbox{-}}rm peptide composition, probabilistic suffix tree, support vector machines, subcellular localization
21	Michael A. Maniscalco, Simon J. Puglisi	An efficient, versatile approach to suffix sorting.	ACM J. Exp. Algorithmics	2007	DBLP DOI BibTeX RDF	Suffix sorting, suffix tree, suffix array, Burrows-Wheeler transform
21	Simon J. Puglisi, William F. Smyth, Andrew Turpin	A taxonomy of suffix array construction algorithms.	ACM Comput. Surv.	2007	DBLP DOI BibTeX RDF	suffix sorting, suffix tree, Suffix array, Burrows-Wheeler transform
21	Neel Sundaresan, Kavita Ganesan, Roopnath Grandhi	Multi-factor clustering for a marketplace search interface.	WWW	2007	DBLP DOI BibTeX RDF	clustering, algorithms, suffix-tree, linear
21	Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim	A Practical Method for Approximate Subsequence Search in DNA Databases.	PAKDD	2007	DBLP DOI BibTeX RDF	DNA database, approximate subsequence search, suffix tree
21	Prahlad Fogla, Wenke Lee	q-Gram Matching Using Tree Models.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	q{hbox{-}}{rm gram} matching, Intrusion detection, pattern matching, trees, string matching, search problems, suffix tree, tree data structure, word processing
21	Atsuhiro Takasu	An approximate multi-word matching algorithm for robust document retrieval.	CIKM	2006	DBLP DOI BibTeX RDF	dynamic programming, statistical model, suffix tree
21	Mario Cannataro, Pierangelo Veltri	A Grid Service for Pattern Extraction from Mass Spectrometry Data.	SKG	2006	DBLP DOI BibTeX RDF	Suffix Tree, Grid Services, Mass Spectrometry, Pattern Extraction
21	Paolo Ferragina, Giovanni Manzini	Indexing compressed text.	J. ACM	2005	DBLP DOI BibTeX RDF	Lempel-Ziv compressor, full-text indexing, indexing data structure, suffix tree, suffix array, text compression, Burrows-Wheeler transform, pattern searching
21	Fernando Adrian Das Neves, Edward A. Fox, Xiaoyan Yu	Connecting topics in document collections with stepping stones and pathways.	CIKM	2005	DBLP DOI BibTeX RDF	collection building from syllabi, query splitting, suffix-tree clustering, pathways, stepping stones, cluster labeling
21	Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano	An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.	IEEE ACM Trans. Comput. Biol. Bioinform.	2004	DBLP DOI BibTeX RDF	Boolean patterns, suffix tree, Pattern discovery, suffix array
21	Giovanni Manzini, Paolo Ferragina	Engineering a Lightweight Suffix Array Construction Algorithm.	Algorithmica	2004	DBLP DOI BibTeX RDF	Space-economical algorithms, Full-text index, Suffix tree, Suffix array, Algorithmic engineering
21	Moritz G. Maaß	Linear Bidirectional On-Line Construction of Affix Trees.	Algorithmica	2003	DBLP DOI BibTeX RDF	Affix tree, Pattern matching, Suffix tree, Algorithms and data structures, Amortized analysis
21	Eamonn J. Keogh, Stefano Lonardi, Bill Yuan-chi Chiu	Finding surprising patterns in a time series database in linear time and space.	KDD	2002	DBLP DOI BibTeX RDF	feature extraction, anomaly detection, time series, Markov Model, suffix tree, novelty detection
21	H. V. Jagadish, Olga Kapitskaia, Raymond T. Ng, Divesh Srivastava	One-dimensional and multi-dimensional substring selectivity estimation.	VLDB J.	2000	DBLP DOI BibTeX RDF	String selectivity, Maximal overlap, Short memory property, Pruned count-suffix tree
21	Paolo Ferragina, Giovanni Manzini	Opportunistic Data Structures with Applications.	FOCS	2000	DBLP DOI BibTeX RDF	opportunistic data structures, data indexing, succinct suffix array, suffix tree data structures, suffix array data structures, Glimpse tool, sublinear query time complexity, sublinear space complexity, computational complexity, data structures, search, data compression, data compression, entropy, database theory, data set, database indexing, query performance
21	Süleyman Cenk Sahinalp, Uzi Vishkin	Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	efficient approximate pattern matching, efficient dynamic pattern matching, labeling paradigm, string processing algorithmics, suffix tree construction, dynamic dictionary matching, dynamic text indexing, inserted characters, deleted characters, replaced characters, pattern matching, approximate string matching, optimal parallel algorithm, substrings
21	Michio Nakanishi, Morio Hasidume, Minoru Ito, Akihiro Hashimoto	A Linear-Time Algorithm for Computing Characteristic Strings.	ISAAC	1994	DBLP DOI BibTeX RDF	characteristic string, DNA probe, suffix tree, approximate string matching
21	Elizabeth Shoop, Jaideep Srivastava, Paul Bieganski, John Riedl, Ernest Retzel	An Object-Oriented Genetics Information System.	SAC	1993	DBLP DOI BibTeX RDF	genome sequencing, graphical user interface, object-oriented database, suffix tree, computational molecular biology
20	Bo Zhang, Zhihua Geng, Aoying Zhou	SIMP: Efficient XML Structural Index for Multiple Query Processing.	WAIM	2008	DBLP DOI BibTeX RDF
20	Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi	On the Longest Common Factor Problem.	IFIP TCS	2008	DBLP DOI BibTeX RDF
20	Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira	Indexed Hierarchical Approximate String Matching.	SPIRE	2008	DBLP DOI BibTeX RDF
20	Marcel H. Schulz, David Weese, Tobias Rausch, Andreas Döring 0001, Knut Reinert, Martin Vingron	Fast and Adaptive Variable Order Markov Chain Construction.	WABI	2008	DBLP DOI BibTeX RDF
20	Johannes Fischer 0001, Volker Heun	A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.	ESCAPE	2007	DBLP DOI BibTeX RDF
20	Gerth Stølting Brodal, Rolf Fagerberg	Cache-oblivious string dictionaries.	SODA	2006	DBLP DOI BibTeX RDF
20	Luís M. S. Russo, Arlindo L. Oliveira	A Compressed Self-index Using a Ziv-Lempel Dictionary.	SPIRE	2006	DBLP DOI BibTeX RDF
20	Feng Gao 0016, Mohammed Javeed Zaki	PSIST: Indexing Protein Structures Using Suffix Trees.	CSB	2005	DBLP DOI BibTeX RDF
20	Zhixiang Chen 0001, Richard H. Fowler, Ada Wai-Chee Fu, Chunyue Wang	Linear and Sublinear Time Algorithms for Mining Frequent Traversal Path Patterns from Very Large Web Logs.	IDEAS	2003	DBLP DOI BibTeX RDF
20	Donald A. Adjeroh, Yong Zhang 0050, Amar Mukherjee, Matt Powell, Tim Bell 0001	DNA Sequence Compression Using the Burrows-Wheeler Transform.	CSB	2002	DBLP DOI BibTeX RDF	DNA sequence compression, repetition structures, Burrows-Wheeler Transform, BWT
20	Daisuke Ikeda	Characteristic Sets of Strings Common to Semi-structured Documents.	Discovery Science	1999	DBLP DOI BibTeX RDF
20	Süleyman Cenk Sahinalp, Uzi Vishkin	On a Parallel-Algorithms Method for String Matching Problems.	CIAC	1994	DBLP DOI BibTeX RDF
20	Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht	Complete inverted files for efficient text retrieval and analysis.	J. ACM	1987	DBLP DOI BibTeX RDF
19	Evie Andrew, Travis Monk, André van Schaik	An Event based Prediction Suffix Tree.	CoRR	2023	DBLP DOI BibTeX RDF