Binary Character Supertrees is a supertree method that constructs a phylogenetic supertree by encoding input trees as binary character matrices and applying maximum parsimony to infer the most compact evolutionary hypothesis that encompasses the topological information of constituent trees.
2
Publications
44
Citations
6
Authors
5
Institutions
Publications per year
2017–2026
0
Parents
Publications
2
Alberto Apostolico, Maxime Crochemore, Martı́n Farach-Colton et al. · Communications of the ACM · 2016 · 25 citations · Full text
1–2 of 2
Authors
6
- AA
1
h-index
- SMS. Muthukrishnan
Rutgers, The State University of New Jersey, United States
1 publications · 25 citations
1
h-index
- ZG
1
h-index
- MFMartı́n Farach-Colton
Rutgers, The State University of New Jersey, United States
1 publications · 25 citations
1
h-index
- DB
1
h-index
1–5 of 6
Institutions
5
Google (United States)
Mountain View, United States
1 h-index
1 publications
25 citations
University of Canterbury
Christchurch, New Zealand
1 h-index
1 publications
19 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
25 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
2 publications
50 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
1 publications
25 citations
1–5 of 5
Venues
- Communications of the ACM
1 publications · 25 citations
1
h-index
- Journal of Computational Biology
1 publications · 19 citations
1
h-index
1–2