Sciweavers

234 search results - page 34 / 47
» A Simple Statistical Algorithm for Biological Sequence Compr...
Sort
View
BMCBI
2004
208views more  BMCBI 2004»
13 years 7 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
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
CRV
2005
IEEE
219views Robotics» more  CRV 2005»
14 years 1 months ago
People Tracking using Robust Motion Detection and Estimation
Real world computer vision systems highly depend on reliable, robust retrieval of motion cues to make accurate decisions about their surroundings. In this paper, we present a simp...
Markus Latzel, Emilie Darcourt, John K. Tsotsos
ICML
2005
IEEE
14 years 8 months ago
A general regression technique for learning transductions
The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods ...
Corinna Cortes, Mehryar Mohri, Jason Weston