Sciweavers

482 search results - page 38 / 97
» Barcodes for genomes and applications
Sort
View
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
BMCBI
2007
89views more  BMCBI 2007»
13 years 7 months ago
Comparing segmentations by applying randomization techniques
Background: There exist many segmentation techniques for genomic sequences, and the segmentations can also be based on many different biological features. We show how to evaluate ...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
RECOMB
2001
Springer
14 years 8 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
ICMLA
2008
13 years 9 months ago
Target Selection: A New Learning Paradigm and Its Application to Genetic Association Studies
In this work, a new learning paradigm called target selection is proposed, which can be used to test for associations between a single genetic variable and a multidimensional, qua...
Johannes Mohr, Sambu Seo, Imke Puis, Andreas Heinz...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 5 months ago
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
Michal Nánási, Tomás Vinar, B...