— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Background: While the pairwise alignments produced by sequence similarity searches are a powerful tool for identifying homologous proteins - proteins that share a common ancestor ...
Michael L. Sierk, Michael E. Smoot, Ellen J. Bass,...
Background: An important problem in genomics is the automatic inference of groups of homologous proteins from pairwise sequence similarities. Several approaches have been proposed...
Background: Whole genome shotgun sequencing produces increasingly higher coverage of a genome with random sequence reads. Progressive whole genome assembly and eventual finishing ...
Qunfeng Dong, Matthew D. Wilkerson, Volker Brendel
Background: Spatially mapped large scale gene expression databases enable quantitative comparison of data measurements across genes, anatomy, and phenotype. In most ongoing effort...
Christopher Lau, Lydia Ng, Carol Thompson, Sayan D...