Sciweavers

19 search results - page 3 / 4
» Fast and Sensitive Algorithm for Aligning ESTs to Human Geno...
Sort
View
NAR
2007
113views more  NAR 2007»
13 years 7 months ago
The UCSC genome browser database: update 2007
The University of California, Santa Cruz Genome Browser Database contains, as of September 2006, sequence and annotation data for the genomes of 13 vertebrate and 19 invertebrate ...
Robert M. Kuhn, Donna Karolchik, Ann S. Zweig, Hea...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 11 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
BMCBI
2010
139views more  BMCBI 2010»
13 years 7 months ago
CMASA: an accurate algorithm for detecting local protein structural similarity and its application to enzyme catalytic site anno
Background: The rapid development of structural genomics has resulted in many "unknown function" proteins being deposited in Protein Data Bank (PDB), thus, the functiona...
Gong-Hua Li, Jing-Fei Huang
BMCBI
2011
12 years 11 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
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell