Sciweavers

120 search results - page 5 / 24
» How Much Can We Gain from Supervised Word Alignment
Sort
View
BMCBI
2005
87views more  BMCBI 2005»
13 years 10 months ago
ProfNet, a method to derive profile-profile alignment scoring functions that improves the alignments of distantly related protei
Background: Profile-profile methods have been used for some years now to detect and align homologous proteins. The best such methods use information from the background distributi...
Tomas Ohlson, Arne Elofsson
ACL
2010
13 years 8 months ago
Finding Cognate Groups Using Phylogenies
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
David Hall, Dan Klein
RECOMB
2001
Springer
14 years 10 months ago
Applications of generalized pair hidden Markov models to alignment and gene finding problems
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
Lior Pachter, Marina Alexandersson, Simon Cawley
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 10 months ago
Structured entity identification and document categorization: two tasks with one joint model
Traditionally, research in identifying structured entities in documents has proceeded independently of document categorization research. In this paper, we observe that these two t...
Indrajit Bhattacharya, Shantanu Godbole, Sachindra...
JCB
2000
105views more  JCB 2000»
13 years 10 months ago
A Greedy Algorithm for Aligning DNA Sequences
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...