Sciweavers

773 search results - page 23 / 155
» Suffix Trees on Words
Sort
View
DLT
2008
15 years 8 months ago
Construction of Tree Automata from Regular Expressions
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...
Dietrich Kuske, Ingmar Meinecke
SIGSOFT
2007
ACM
16 years 7 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
BIRD
2007
Springer
128views Bioinformatics» more  BIRD 2007»
16 years 23 days 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...
ICALP
2009
Springer
16 years 6 months ago
The Ehrenfeucht-Silberger Problem
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
Stepan Holub, Dirk Nowotka
IADIS
2008
15 years 8 months ago
Towards an Error-Free Stemming
S Stemming is a fundamental step in processing textual data preceding the tasks of information retrieval, text mining, and natural language processing. The common goal of stemming ...
Eiman Tamah Al-Shammari