Sciweavers

612 search results - page 3 / 123
» Sequence Database Search Using Jumping Alignments
Sort
View
ICPADS
2005
IEEE
14 years 3 months ago
Exploiting Multi-level Parallelism for Homology Search using General Purpose Processors
New biological experimental techniques are continuing to generate large amounts of data using DNA, RNA, human genome and protein sequences. The quantity and quality of data from t...
Xiandong Meng, Vipin Chaudhary
BIOCOMP
2007
13 years 11 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 3 months ago
Suboptimal Alignments Improve the Detection of Weak Homologs in Sequence Database Searches
PSI-BLAST remains one of the popular tools for searching remote homologs in sequence databases. We recently demonstrated that hybrid alignment can function as the alignment core f...
Yuheng Li, Mario Lauria, Ralf Bundschuh
BMCBI
2007
156views more  BMCBI 2007»
13 years 10 months ago
Accuracy of structure-based sequence alignment of automatic methods
Background: Accurate sequence alignments are essential for homology searches and for building three-dimensional structural models of proteins. Since structure is better conserved ...
Changhoon Kim, Byungkook Lee
BMCBI
2011
13 years 1 months 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