Sciweavers

141 search results - page 11 / 29
» Genome Rearrangement in Mitochondria and Its Computational B...
Sort
View
RECOMB
2003
Springer
15 years 10 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...
BMCBI
2010
95views more  BMCBI 2010»
14 years 9 months ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...
RECOMB
2007
Springer
15 years 10 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
JAMIA
2010
91views more  JAMIA 2010»
14 years 4 months ago
Serving the enterprise and beyond with informatics for integrating biology and the bedside (i2b2)
Informatics for Integrating Biology and the Bedside (i2b2) is one of seven projects sponsored by the NIH Roadmap National Centers for Biomedical Computing (http://www. ncbcs.org)....
Shawn N. Murphy, Griffin Weber, Michael Mendis, Vi...
ALMOB
2006
110views more  ALMOB 2006»
14 years 9 months ago
Computing distribution of scale independent motifs in biological sequences
The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable ...
Jonas S. Almeida, Susana Vinga