Sciweavers

26 search results - page 4 / 6
» Suffix Vector: A Space-Efficient Suffix Tree Representation
Sort
View
CIKM
2005
Springer
14 years 4 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
ACMSE
2006
ACM
14 years 22 days ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
ICMCS
2009
IEEE
250views Multimedia» more  ICMCS 2009»
13 years 8 months ago
Efficient sparse self-similarity matrix construction for repeating sequence detection
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
Lei Wang, Chng Eng Siong, Haizhou Li
BIRD
2007
Springer
128views Bioinformatics» more  BIRD 2007»
14 years 5 months ago
Efficient and Scalable Indexing Techniques for Biological Sequence Data
We investigate indexing techniques for sequence data, crucial in a wide variety of applications, where efficient, scalable, and versatile search algorithms are required. Recent res...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
SIGSOFT
2007
ACM
14 years 11 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek