86 search results - page 1 / 18 » DNA Sequence Design by Dynamic Neighborhood Searches |
DNA
2006
Springer
13 years 8 months ago
2006
Springer
ISMB
1996
13 years 6 months ago
1996
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
TCBB
2008
13 years 4 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
BMCBI
2010
13 years 4 months ago
2010
Background: Mitochondrial DNA (mtDNA) is widely being used for population genetics, forensic DNA fingerprinting and clinical disease association studies. The recent past has uncov...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...