Sciweavers

497 search results - page 56 / 100
» Neighborhood-Based Local Sensitivity
Sort
View
ALMOB
2006
155views more  ALMOB 2006»
13 years 8 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...
BMCBI
2005
125views more  BMCBI 2005»
13 years 7 months ago
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Background: We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous ver...
Amarendran R. Subramanian, Jan Weyer-Menkhoff, Mic...
RECOMB
2004
Springer
14 years 8 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
BMCBI
2010
138views more  BMCBI 2010»
13 years 8 months ago
Sigma-2: Multiple sequence alignment of non-coding DNA via an evolutionary model
Background: While most multiple sequence alignment programs expect that all or most of their input is known to be homologous, and penalise insertions and deletions, this is not a ...
Gayathri Jayaraman, Rahul Siddharthan
BMCBI
2005
152views more  BMCBI 2005»
13 years 7 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
Markus Wistrand, Erik L. L. Sonnhammer