Sciweavers

40 search results - page 6 / 8
» Inferring Positional Homologs with Common Intervals of Seque...
Sort
View
BMCBI
2010
123views more  BMCBI 2010»
13 years 8 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
2007
131views more  BMCBI 2007»
13 years 7 months ago
An improved method for identifying functionally linked proteins using phylogenetic profiles
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
Shawn Cokus, Sayaka Mizutani, Matteo Pellegrini
BMCBI
2007
165views more  BMCBI 2007»
13 years 8 months ago
Direct maximum parsimony phylogeny reconstruction from genotype data
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet
BMCBI
2008
126views more  BMCBI 2008»
13 years 8 months ago
c-REDUCE: Incorporating sequence conservation to detect motifs that correlate with expression
Background: Computational methods for characterizing novel transcription factor binding sites search for sequence patterns or "motifs" that appear repeatedly in genomic ...
Katerina Kechris, Hao Li