Sciweavers

223 search results - page 14 / 45
» Suffix Arrays on Words
Sort
View
STRINGOLOGY
2008
13 years 8 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 5 months ago
Estimating the Lengths of Memory Words
For a stationary stochastic process {Xn} with values in some set A, a finite word w AK is called a memory word if the conditional probability of X0 given the past is constant on t...
Gusztáv Morvai, Benjamin Weiss
DLT
2008
13 years 8 months ago
On the Relation between Periodicity and Unbordered Factors of Finite Words
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equ...
Stepan Holub, Dirk Nowotka
LREC
2010
170views Education» more  LREC 2010»
13 years 8 months ago
Arabic Word Segmentation for Better Unit of Analysis
The Arabic language has a very rich morphology where a word is composed of zero or more prefixes, a stem and zero or more suffixes. This makes Arabic data sparse compared to other...
Yassine Benajiba, Imed Zitouni
SIGSOFT
2007
ACM
14 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