4212 search results - page 775 / 843 » On Compressible Pairings and Their Computation |
156
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
183
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
165
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
214
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: In the context of the BioCreative competition, where training data were very sparse, we investigated two complementary tasks: 1) given a Swiss-Prot triplet, containing...
172
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...