Sciweavers

131 search results - page 2 / 27
» Computational complexity of isothermic DNA sequencing by hyb...
Sort
View
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
13 years 10 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 4 months ago
Hybrid Genetic Algorithm for DNA Sequencing with Errors
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
Jacek Blazewicz, Marta Kasprzak, Wojciech Kuroczyc...
ISMB
1996
13 years 6 months ago
Genome-Scale DNA Sequence Recognition by Hybridization to Short Oligomers
Aleksandar Milosavljevic, Suzana Savkovic, Radomir...
GECCO
1999
Springer
13 years 9 months ago
Reaction Temperature Constraints in DNA Computing
Using the thermodynamics of DNA melting, a technique is proposed to choose a reaction temperature for the DNA computation that minimizes the potential for mishybridizations. Adlem...
Russell J. Deaton
BMCBI
2010
121views more  BMCBI 2010»
13 years 2 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...