Sciweavers

1798 search results - page 185 / 360
» A Tree for All Seasons
Sort
View
BMCBI
2006
139views more  BMCBI 2006»
13 years 9 months ago
DNA Molecule Classification Using Feature Primitives
Background: We present a novel strategy for classification of DNA molecules using measurements from an alpha-Hemolysin channel detector. The proposed approach provides excellent c...
Raja Tanveer Iqbal, Matthew Landry, Stephen Winter...
DAM
2007
107views more  DAM 2007»
13 years 9 months ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
IWPEC
2010
Springer
13 years 7 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
BMCBI
2011
13 years 4 months ago
N-gram analysis of 970 microbial organisms reveals presence of biological language models
Background: It has been suggested previously that genome and proteome sequences show characteristics typical of natural-language texts such as “signature-style” word usage ind...
Hatice U. Osmanbeyoglu, Madhavi Ganapathiraju
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 4 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer