Sciweavers

539 search results - page 8 / 108
» Linear complexity of transformed sequences
Sort
View
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 3 months ago
Twisting q-holonomic sequences by complex roots of unity
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
Stavros Garoufalidis, Christoph Koutschan
VLSID
2007
IEEE
94views VLSI» more  VLSID 2007»
14 years 7 months ago
A Reduced Complexity Algorithm for Minimizing N-Detect Tests
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
Kalyana R. Kantipudi, Vishwani D. Agrawal
CPM
1999
Springer
99views Combinatorics» more  CPM 1999»
13 years 11 months ago
On the Complexity of Positional Sequencing by Hybridization
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Shara...
BMCBI
2007
116views more  BMCBI 2007»
13 years 7 months ago
Linear array of conserved sequence motifs to discriminate protein subfamilies: study on pyridine nucleotide-disulfide reductases
Background: The pyridine nucleotide disulfide reductase (PNDR) is a large and heterogeneous protein family divided into two classes (I and II), which reflect the divergent evoluti...
César L. Avila, Viviana A. Rapisarda, Ricar...
BMCBI
2010
142views more  BMCBI 2010»
13 years 7 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...