Sciweavers

353 search results - page 8 / 71
» Dynamic programming alignment accuracy
Sort
View
IEEEMSP
2002
IEEE
118views Multimedia» more  IEEEMSP 2002»
14 years 17 days ago
Similarity matching of continuous melody contours for humming querying of melody databases
Music query-by-humming is a challenging problem since the humming query inevitably contains much variation and inaccuracy. Many of the previous methods, which adopt note segmentat...
Yongwei Zhu, Mohan S. Kankanhalli, Qi Tian
BMCBI
2007
147views more  BMCBI 2007»
13 years 7 months ago
MaxAlign: maximizing usable data in an alignment
Background: The presence of gaps in an alignment of nucleotide or protein sequences is often an inconvenience for bioinformatical studies. In phylogenetic and other analyses, for ...
Rodrigo Gouveia-Oliveira, Peter Wad Sackett, Ander...
EMMCVPR
2003
Springer
14 years 25 days ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 1 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
TCBB
2010
114views more  TCBB 2010»
13 years 6 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...