Reconciliation Algorithms

Reconciliation Algorithms is a computational method that belongs to the class of phylogenetic tree comparison techniques, distinguished by its specific purpose of mapping evolutionary events between two or more phylogenetic trees to infer coevolutionary relationships or horizontal transfer events.

74

Publications

4.4K

Citations

193

Authors

114

Institutions

Publications per year

2017–2026

19

Authors

193

  1. CS
    Céline Scornavacca

    Institut des Sciences de l'Evolution de Montpellier, France

    10 publications · 380 citations

    10

    h-index

  2. MS
    Mukul S. Bansal

    University of Connecticut, United States

    10 publications · 510 citations

    10

    h-index

  3. RL
    Ran Libeskind-Hadas

    Harvey Mudd College, United States

    6 publications · 192 citations

    6

    h-index

  4. VB
    Vincent Berry

    Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, France

    5 publications · 143 citations

    5

    h-index

  5. ÉT
    Éric Tannier

    Centre National de la Recherche Scientifique, France

    5 publications · 186 citations

    5

    h-index

1–5 of 193

Venues

  1. 12

    h-index

  2. Bioinformatics

    10 publications · 1K citations

    10

    h-index

  3. BMC Bioinformatics

    11 publications · 406 citations

    10

    h-index

  4. Algorithms for Molecular Biology

    AMB · 5 publications · 145 citations

    5

    h-index

  5. Systematic Biology

    3 publications · 581 citations

    3

    h-index

1–5