Sciweavers

391 search results - page 42 / 79
» Aligning Two Fragmented Sequences
Sort
View
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
BMCBI
2005
140views more  BMCBI 2005»
13 years 9 months ago
JACOP: A simple and robust method for the automated classification of protein sequences with modular architecture
Background: Whole-genome sequencing projects are rapidly producing an enormous number of new sequences. Consequently almost every family of proteins now contains hundreds of membe...
Peter Sperisen, Marco Pagni
JCB
2007
94views more  JCB 2007»
13 years 9 months ago
Locality and Gaps in RNA Comparison
Locality is an important and well-studied notion in comparative analysis of biological sequences. Similarly, taking into account affine gap penalties when calculating biological ...
Rolf Backofen, Shihyen Chen, Danny Hermelin, Gad M...
BMCBI
2006
85views more  BMCBI 2006»
13 years 10 months ago
On single and multiple models of protein families for the detection of remote sequence relationships
Background: The detection of relationships between a protein sequence of unknown function and a sequence whose function has been characterised enables the transfer of functional a...
James A. Casbon, Mansoor A. S. Saqi
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
14 years 4 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng