CiteSeerX — Search Results — State Complexity of the Subword Closure Operation with Applications to DNA Coding

Results 1 - 10 of 48

International Journal of Foundations of Computer Science c © World Scientific Publishing Company STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING∗

by Stavros Konstantinidis

"... Communicated by Editor’s name We are interested in the state complexity of languages that are defined via the subword closure operation. The subword closure of a set S of fixed-length words is the set of all words w for which any subword of w of the fixed length is in S. This type of constraint appe ..."

Abstract - Add to MetaCart

also discuss the state complexity of DNA computing related cases of the subword closure operation.

Quotient complexity of closed languages

by Janusz Brzozowski, Galina Jiraskova, Chenglong Zou

"... A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by subword we mean sub-sequence. We study the quotient complexity (usually called state com-plexity) of operations on ..."

Abstract - Cited by 12 (6 self) - Add to MetaCart

A language L is prefix-closed if, whenever a word w is in L, then every prefix of w is also in L. We define suffix-, factor-, and subword-closed languages in an analogous way, where by subword we mean sub-sequence. We study the quotient complexity (usually called state com-plexity) of operations

TO CODE OR NOT TO CODE

by Présentée À La, Faculté Informatique, Et Communications, Section Des, Systèmes De Communication, Du Grade, De Docteur, Ès Sciences, Prof M. Vetterli, Prof B. Rimoldi, Prof R. Gallager, Prof A. Lapidoth, Prof J. Massey, Prof E. Telatar, Prof S. Verdú, Michael Gastpar, Amos Lapidoth, Jim Ma , 2002

"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."

Abstract - Add to MetaCart

de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:

International Journal of Foundations of Computer Science c World Scientic Publishing Company OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS

by Lila Kari, Petr Sos

"... Communicated by Editor's name We study binary word operations of the insertion, deletion and substitution type. Many of these operations can be generalized into a unied framework by introducing so-called trajectory condition. This generalization has been previously made for insertion and deleti ..."

Abstract - Add to MetaCart

and deletion operations. In this paper we naturally extend this approach also to substi-tution operations. We study closure properties and decision problems of substitutions on trajectories. The obtained results are then applied to model complex noisy channels and a cryptanalysis problem. Another application

Complexity in convex languages

by Janusz Brzozowski - Proceedings of the 4th International Conference on Language and Automata Theory (LATA). Volume 6031 of LNCS , 2010

"... Abstract. A language L is prefix-convex if, whenever words u and w are in L with u a prefix of w, then every word v which has u as a prefix and is a prefix of w is also in L. Similarly, we define suffix-, factor-, and subword-convex languages, where by subword we mean subsequence. To-gether, these l ..."

Abstract - Cited by 4 (1 self) - Add to MetaCart

analyzed together, and have been solved by similar methods. The state complexities of regular operations in subclasses of convex languages have been examined together, with considerable economies of effort. This paper surveys the recent results on convex languages with an emphasis on complexity issues.

Trajectory-Based Operations

by Michael Domaratzki , 2004

"... Shuffle on trajectories was introduced by Mateescu et al. [147] as a method of generalizing sev-eral studied operations on words, such as the shuffle, concatenation and insertion operations. This natural construction has received significant and varied attention in the literature. In this thesis, we ..."

Abstract - Cited by 4 (2 self) - Add to MetaCart

, we consider several unexamined areas related to shuffle on trajectories. We first examine the state complexity of the shuffle on trajectories. We find that the density of the set of trajectories is an appropriate measure of the complexity of the associated operation, since low density sets

Evaluation and application of microsatellite and major histocompatability complex variation for stock identification of coho salmon

by Terry D Beacham , John R Candy , K Janine Supernault , Tobi Ming , Bruce Deagle , Angela Schulze , Debra Tuck , Karia H Kaukinen , James R Irvine , AND Kristina M Miller , Ruth E Withler - in British Columbia.Transactions of the American Fisheries Society , 2001

"... Abstract.-Variation at eight microsatellite loci and two linked exons of a major histocompatibility complex (MHC) locus was surveyed in approximately 21,000 coho salmon Oncorhynchus kisutch sampled from 138 localities ranging from southeast Alaska to the Columbia River, the majority of the sites be ..."

Abstract - Cited by 14 (3 self) - Add to MetaCart

IDENTIFICATION OF COHO SALMON two exons (coding portion of a gene) of a major histocompatibilty complex (MHC) locus. We used a PCR-based (polymerase chain reaction) approach to ensure cost effectiveness and speed in establishing the database and to enable nonlethal sampling for mixed-stock analysis