Sciweavers

745 search results - page 13 / 149
» The origins of combinatorics on words
Sort
View
DAM
2011
15 years 1 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
DLT
2007
15 years 7 months ago
Two Element Unavoidable Sets of Partial Words
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
Francine Blanchet-Sadri, N. C. Brownstein, Justin ...
COLING
2002
15 years 5 months ago
Interactive Paraphrasing Based on Linguistic Annotation
We propose a method "Interactive Paraphrasing" which enables users to interactively paraphrase words in a document by their definitions, making use of syntactic annotati...
Ryuichiro Higashinaka, Katashi Nagao
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
15 years 11 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
ORL
2008
101views more  ORL 2008»
15 years 6 months ago
Gear composition and the stable set polytope
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields cou...
Anna Galluccio, Claudio Gentile, Paolo Ventura