Sciweavers

14 search results - page 2 / 3
» An Approximation Algorithm for Computing a Parsimonious Firs...
Sort
View
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
13 years 9 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
RECOMB
2010
Springer
13 years 2 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff
JMLR
2006
103views more  JMLR 2006»
13 years 4 months ago
MinReg: A Scalable Algorithm for Learning Parsimonious Regulatory Networks in Yeast and Mammals
In recent years, there has been a growing interest in applying Bayesian networks and their extensions to reconstruct regulatory networks from gene expression data. Since the gene ...
Dana Pe'er, Amos Tanay, Aviv Regev
RECOMB
2006
Springer
14 years 4 months ago
Evolution of Tandemly Repeated Sequences Through Duplication and Inversion
Abstract. Given a phylogenetic tree T for a family of tandemly repeated genes and their signed order O on the chromosome, we aim to find the minimum number of inversions compatible...
Denis Bertrand, Mathieu Lajoie, Nadia El-Mabrouk, ...
BMCBI
2010
135views more  BMCBI 2010»
13 years 4 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas