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...
: 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...
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
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...
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...