Sciweavers

86 search results - page 5 / 18
» DNA Sequence Design by Dynamic Neighborhood Searches
Sort
View
94
Voted
CEC
2008
IEEE
15 years 6 months ago
A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
Bernabé Dorronsoro, Enrique Alba, Gabriel L...
85
Voted
CSB
2003
IEEE
15 years 5 months ago
A New Approach for Gene Annotation Using Unambiguous Sequence Joining
The problem addressed by this paper is accurate and automatic gene annotation following precise identification/annotation of exon and intron boundaries of biologically verified ...
Alexandre Tchourbanov, Daniel Quest, Hesham H. Ali...
BMCBI
2007
247views more  BMCBI 2007»
14 years 11 months ago
A survey of DNA motif finding algorithms
Background: Unraveling the mechanisms that regulate gene expression is a major challenge in biology. An important task in this challenge is to identify regulatory elements, especi...
Modan K. Das, Ho-Kwok Dai
BMCBI
2010
95views more  BMCBI 2010»
14 years 11 months ago
An effective approach for identification of in vivo protein-DNA binding sites from paired-end ChIP-Seq data
Background: ChIP-Seq, which combines chromatin immunoprecipitation (ChIP) with high-throughput massively parallel sequencing, is increasingly being used for identification of prot...
Congmao Wang, Jie Xu, Dasheng Zhang, Zoe A. Wilson...
82
Voted
ANOR
2010
102views more  ANOR 2010»
14 years 11 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover