Sciweavers

1607 search results - page 53 / 322
» The existence of k-radius sequences
Sort
View
MST
2006
104views more  MST 2006»
13 years 10 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
BMCBI
2005
100views more  BMCBI 2005»
13 years 10 months ago
Scoredist: A simple and robust protein sequence distance estimator
Background: Distance-based methods are popular for reconstructing evolutionary trees thanks to their speed and generality. A number of methods exist for estimating distances from ...
Erik L. L. Sonnhammer, Volker Hollich
RECOMB
2005
Springer
14 years 10 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ISMB
1998
13 years 11 months ago
A Hidden Markov Model for Predicting Transmembrane Helices in Protein Sequences
A novel method to model and predict the location and orientation of alpha helices in membrane- spanning proteins is presented. It is based on a hidden Markov model (HMM) with an a...
Erik L. L. Sonnhammer, Gunnar von Heijne, Anders K...