Sciweavers

932 search results - page 92 / 187
» Sequence Complexity for Biological Sequence Analysis
Sort
View
BMCBI
2008
99views more  BMCBI 2008»
13 years 9 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey
BMCBI
2010
156views more  BMCBI 2010»
13 years 9 months ago
Mathematical model for empirically optimizing large scale production of soluble protein domains
Background: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically ...
Eisuke Chikayama, Atsushi Kurotani, Takanori Tanak...
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
14 years 1 months ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
RECOMB
2008
Springer
14 years 9 months ago
Ancestral Reconstruction by Asymmetric Wagner Parsimony over Continuous Characters and Squared Parsimony over Distributions
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
Miklós Csürös
WOB
2003
140views Bioinformatics» more  WOB 2003»
13 years 10 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....