2877 search results - page 279 / 576 » Biological Computing |
152
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
161
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
The correct interpretation of tandem mass spectra is a difficult problem, even when it is limited to scoring peptides against a database. De novo sequencing is considerably harder...
173
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
We describe a novel method for detecting the domain structure of a protein from sequence information alone. The method is based on analyzing multiple sequence alignments that are ...
189
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
189
click to vote
RECOMB
2002
Springer
16 years 7 months ago
2002
Springer
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...