Sciweavers

67 search results - page 8 / 14
» Pattern discovery in sequences under a Markov assumption
Sort
View
BMCBI
2011
13 years 2 months ago
PhyloSim - Monte Carlo simulation of sequence evolution in the R statistical computing environment
Background: The Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progr...
Botond Sipos, Tim Massingham, Gregory E. Jordan, N...
RECOMB
2002
Springer
14 years 8 months ago
Monotony of surprise and large-scale quest for unusual words
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
Alberto Apostolico, Mary Ellen Bock, Stefano Lonar...
ICDAR
2007
IEEE
14 years 2 months ago
Handwritten Word Recognition Using Conditional Random Fields
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
Shravya Shetty, Harish Srinivasan, Sargur N. Sriha...
TROB
2008
113views more  TROB 2008»
13 years 7 months ago
Occam's Razor Applied to Network Topology Inference
We present a method for inferring the topology of a sensor network given nondiscriminating observations of activity in the monitored region. This is accomplished based on no prior ...
Dimitri Marinakis, Gregory Dudek
ALMOB
2006
138views more  ALMOB 2006»
13 years 7 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh