Sciweavers

92 search results - page 3 / 19
» Maximal repetitions in strings
Sort
View
STRINGOLOGY
2008
13 years 7 months ago
Conservative String Covering of Indeterminate Strings
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
Pavlos Antoniou, Maxime Crochemore, Costas S. Ilio...
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 5 months ago
Strings with Maximally Many Distinct Subsequences and Substrings
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
CPM
2000
Springer
92views Combinatorics» more  CPM 2000»
13 years 10 months ago
Finding Maximal Quasiperiodicities in Strings
Gerth Stølting Brodal, Christian N. S. Pede...
CJ
2007
53views more  CJ 2007»
13 years 5 months ago
Locating Maximal Multirepeats in Multiple Strings Under Various Constraints
A. Bakalis, Costas S. Iliopoulos, Christos Makris,...