Sciweavers

516 search results - page 10 / 104
» Sets of k-Independent Strings
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 4 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
CIAC
2010
Springer
194views Algorithms» more  CIAC 2010»
14 years 10 days ago
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Hui Zhang, Qing Guo, Costas S. Iliopoulos
ACL
2010
13 years 5 months ago
Automatic Sanskrit Segmentizer Using Finite State Transducers
In this paper, we propose a novel method for automatic segmentation of a Sanskrit string into different words. The input for our segmentizer is a Sanskrit string either encoded as...
Vipul Mittal
ICALP
2001
Springer
13 years 12 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 8 months ago
Distance Based Indexing for String Proximity Search
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
Jai Macker, Murat Tasan, Süleyman Cenk Sahina...