Sciweavers

103 search results - page 1 / 21
» Minimal Separating Sequences for All Pairs of States
Sort
View
ISMB
1993
13 years 6 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
BMCBI
2004
97views more  BMCBI 2004»
13 years 4 months ago
Global features of sequences of bacterial chromosomes, plasmids and phages revealed by analysis of oligonucleotide usage pattern
Background: Oligonucleotide frequencies were shown to be conserved signatures for bacterial genomes, however, the underlying constraints have yet not been resolved in detail. In t...
Oleg N. Reva, Burkhard Tümmler
MST
2007
132views more  MST 2007»
13 years 4 months ago
Odometers on Regular Languages
Odometers or “adding machines” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this no...
Valérie Berthé, Michel Rigo
CCCG
2010
13 years 6 months ago
On stretch minimization problem on unit strip paper
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
Ryuhei Uehara
JSYML
2007
100views more  JSYML 2007»
13 years 4 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore