Sciweavers

6 search results - page 1 / 2
» The most probable annotation problem in HMMs and its applica...
Sort
View
JCSS
2007
116views more  JCSS 2007»
13 years 4 months ago
The most probable annotation problem in HMMs and its application to bioinformatics
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Brona Brejová, Daniel G. Brown 0001, Tom&aa...
BMCBI
2010
123views more  BMCBI 2010»
13 years 5 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod
BMCBI
2010
117views more  BMCBI 2010»
13 years 5 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
CSB
2002
IEEE
230views Bioinformatics» more  CSB 2002»
13 years 9 months ago
Prediction of Protein Function Using Protein-Protein Interaction Data
Assigning functions to novel proteins is one of the most important problems in the post-genomic era. Several approaches have been applied to this problem, including analyzing gene...
Minghua Deng, Kui Zhang, Shipra Mehta, Ting Chen, ...
ISBRA
2007
Springer
13 years 11 months ago
Reconstruction of 3D Structures from Protein Contact Maps
Proteins are large organic compounds made of amino acids arranged in a linear chain (primary structure). Most proteins fold into unique threedimensional (3D) structures called inte...
Marco Vassura, Luciano Margara, Filippo Medri, Pie...