Sciweavers

10602 search results - page 328 / 2121
» Weakly Useful Sequences
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
15 years 7 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
IJCV
2006
121views more  IJCV 2006»
15 years 6 months ago
Feature-Based Sequence-to-Sequence Matching
This paper studies the problem of matching two unsynchronized video sequences of the same dynamic scene, recorded by different stationary uncalibrated video cameras. The matching i...
Yaron Caspi, Denis Simakov, Michal Irani
BMCBI
2005
150views more  BMCBI 2005»
15 years 6 months ago
Discover protein sequence signatures from protein-protein interaction data
Background: The development of high-throughput technologies such as yeast two-hybrid systems and mass spectrometry technologies has made it possible to generate large protein-prot...
Jianwen Fang, Ryan J. Haasl, Yinghua Dong, Gerald ...
BMCBI
2004
177views more  BMCBI 2004»
15 years 6 months ago
Gapped alignment of protein sequence motifs through Monte Carlo optimization of a hidden Markov model
Background: Certain protein families are highly conserved across distantly related organisms and belong to large and functionally diverse superfamilies. The patterns of conservati...
Andrew F. Neuwald, Jun S. Liu
ICS
2010
Tsinghua U.
16 years 4 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman