scholarly journals Parikh prime vector in partial word

2020 ◽  
Author(s):  
K. Janaki ◽  
R. Arulprakasam ◽  
V. R. Dare
Keyword(s):  
Partial Word ◽  
Prime Vector

CYCLIC PARTIAL WORDS

2020 ◽  
Vol 9 (11) ◽  
pp. 9219-9230
Author(s):  
R.K. Kumari ◽  
R. Arulprakasam ◽  
R. Perumal ◽  
V.R. Dare
Keyword(s):  
Dna Sequencing ◽  
Partial Word ◽  
Partial Words ◽  
Cyclic Words

Partial words are linear words with holes. Cyclic words are derived from linear words by linking its first letter after the last one. Both partial words and cyclic words have wide applications in DNA sequencing. In this paper we introduce cyclic partial words and discuss their periodicity and certain properties. We also establish representation of a cyclic partial word using trees.

scholarly journals Computing the partial word avoidability indices of ternary patterns

2013 ◽  
Vol 23 ◽  
pp. 119-142 ◽  
Author(s):  
F. Blanchet-Sadri ◽  
Andrew Lohr ◽  
Shane Scott
Keyword(s):  
Partial Word

scholarly journals Partial Word and Equality Problems and Banach densities

2020 ◽  
Vol 368 ◽  
pp. 107133
Author(s):  
Angela Carnevale ◽  
Matteo Cavaleri
Keyword(s):  
Partial Word

scholarly journals On the state complexity of partial word DFAs

2015 ◽  
Vol 578 ◽  
pp. 2-12 ◽  
Author(s):  
Eric Balkanski ◽  
F. Blanchet-Sadri ◽  
Matthew Kilgore ◽  
B.J. Wyatt
Keyword(s):  
The State ◽  
State Complexity ◽  
Partial Word

scholarly journals Tiling Periodicity

2010 ◽  
Vol Vol. 12 no. 2 ◽  
Author(s):  
Juhani Karhumaki ◽  
Yury Lifshits ◽  
Wojciech Rytter
Keyword(s):  
Open Problem ◽  
Classical Case ◽  
Side Product ◽  
Compact Representation ◽  
Minimal Size ◽  
Partial Word ◽  
International Audience ◽  
New Type

International audience We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g. a lozenge b is a tiling period of a a b b. We investigate properties of tiling periodicities and design an algorithm working in O(n log (n) log log (n)) time which finds a tiling period of minimal size, the number of such minimal periods and their compact representation. The combinatorics of tiling periods differs significantly from that for classical full periods, for example unlike the classical case the same word can have many different primitive tiling periods. We consider also a related new type of periods called in the paper multi-periods. As a side product of the paper we solve an open problem posted by T. Harju (2003).

Sign in / Sign up

Export Citation Format

Share Document