Sciweavers

497 search results - page 16 / 100
» DNA Computing Based on Splicing: Universality Results
Sort
View
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
14 years 1 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
ISMB
1994
13 years 9 months ago
DNA Sequence Analysis Using Hierarchical ART-based Classification Network
Adaptive resonance theory (ART)describes a class of artificial neural networkarchitectures that act as classification tools whichself-organize, workin realtime, and require no ret...
Cathie LeBlanc, Charles R. Katholi, Thomas R. Unna...
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 7 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
CISIS
2010
IEEE
14 years 1 months ago
A Parallel Programming Framework for Multi-core DNA Sequence Alignment
—A new parallel programming framework for DNA sequence alignment in homogeneous multi-core processor architectures is proposed. Contrasting with traditional coarse-grained parall...
Tiago Jose Barreiros Martins de Almeida, Nuno Fili...
BMCBI
2006
139views more  BMCBI 2006»
13 years 7 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...