142 search results - page 23 / 29 » Reconstruction of Ancestral Genomic Sequences Using Likeliho... |
126
click to vote
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
BMCBI
2008
14 years 9 months ago
2008
Background: High throughput signature sequencing holds many promises, one of which is the ready identification of in vivo transcription factor binding sites, histone modifications...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
Protein sequence alignments are more reliable the shorter the evolutionary distance. Here, we align distantly related proteins using many closely spaced intermediate sequences as ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
The organization and mining of malaria genomic and post-genomic data is important to significantly increase the knowledge of the biology of its causative agents, and is motivated,...