This article presents a model for DNA sequence alignment. In our model, a finite state automaton writes two-dimensional maps of nucleotide sequences. An evolutionary method for se...
We present an efficient, fully automated algorithm to assemble ESTs into full-length cDNA sequences that represent the complete coding regions of a gene. Our EST clustering algori...
Arthur Grossman, Charles Hauser, Hilary J. Holz, J...
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...