Name
Abstract | ||
|---|---|---|
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analyzes and other methods for gene mapping often fail to resolve the ordering of some pairs of neighboring markers, thereby leading to sets of markers ambiguously mapped to the same position. Each individual map is thus a partial order defined on the set of markers, and can be represented as a Directed Acyclic Graph (DAG). In this article, given a phylogenetic tree with a set of DAGs labeling each leaf (species), the goal is to infer, at each leaf, a single combined DAG that is as resolved as possible, considering the complementary information provided by individual maps, and the phylogenetic information provided by the species tree. After combining the individual maps of a leaf into a single DAG, we order incomparable markers by using two successive heuristics for minimizing two distances on the species tree: the breakpoint distance, and the Kemeny distance. We apply our algorithms to the plant species represented in the Gramene database, and we evaluate the simplified maps we obtained. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1089/cmb.2009.0094 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
algorithms,branch-and-bound,genomic rearrangements | Branch and bound,Phylogenetic tree,Gene mapping,Directed acyclic graph,Heuristics,Bioinformatics,Mathematics | Journal |
Volume | Issue | ISSN |
16.0 | 10 | 1066-5277 |
Citations | PageRank | References |
3 | 0.47 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Denis Bertrand | 1 | 70 | 5.90 |
| Mathieu Blanchette | 2 | 631 | 62.65 |
| Nadia El-Mabrouk | 3 | 512 | 41.88 |