Sciweavers

40 search results - page 6 / 8
» QOMA2: Optimizing the alignment of many sequences
Sort
View
BMCBI
2007
106views more  BMCBI 2007»
13 years 8 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
WABI
2007
Springer
14 years 2 months ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 3 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
BMCBI
2010
131views more  BMCBI 2010»
13 years 3 months ago
Dynamics based alignment of proteins: an alternative approach to quantify dynamic similarity
Background: The dynamic motions of many proteins are central to their function. It therefore follows that the dynamic requirements of a protein are evolutionary constrained. In or...
Márton Münz, Rune B. Lyngsø, Jo...
BMCBI
2011
13 years 4 days ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes