Sciweavers

1746 search results - page 195 / 350
» On Compressibility of Protein Sequences
Sort
View
BMCBI
2010
123views more  BMCBI 2010»
13 years 10 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
CGO
2008
IEEE
14 years 4 months ago
Prediction and trace compression of data access addresses through nested loop recognition
This paper describes an algorithm that takes a trace (i.e., a sequence of numbers or vectors of numbers) as input, and from that produces a sequence of loop nests that, when run, ...
Alain Ketterlin, Philippe Clauss
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 10 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
CSB
2005
IEEE
142views Bioinformatics» more  CSB 2005»
14 years 3 months ago
BioMap: Discovering Schema Mapping Using Ontologies
Biologists currently devote significant time and effort searching information for their research. The wide diversity in terminology used inhibit effective computerized and manual...
Zoé Lacroix, Sumedha Gholba, Hervé M...
WABI
2004
Springer
14 years 3 months ago
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
Jens Gramm