Sciweavers

91 search results - page 5 / 19
» Algorithms for optimizing production DNA sequencing
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
Azzedine Boukerche, Jan Mendonca Correa, Alba Cris...
CSB
2003
IEEE
113views Bioinformatics» more  CSB 2003»
14 years 23 days ago
An Optimal DNA Segmentation Based on the MDL Principle
: The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with high concentration of G or C bases; stretches of sequences with an abu...
Wojciech Szpankowski, Wenhui Ren, Lukasz Szpankows...
BMCBI
2005
158views more  BMCBI 2005»
13 years 7 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
AAAI
2000
13 years 8 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
BMCBI
2006
117views more  BMCBI 2006»
13 years 7 months ago
Gene Designer: a synthetic biology tool for constructing artificial DNA segments
Background: Direct synthesis of genes is rapidly becoming the most efficient way to make functional genetic constructs and enables applications such as codon optimization, RNAi re...
Alan Villalobos, Jon E. Ness, Claes Gustafsson, Je...