Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
71 | Jianrong Dong, David Fernández-Baca, Fred R. McMorris |
Constructing Majority-Rule Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 9th International Workshop, WABI 2009, Philadelphia, PA, USA, September 12-13, 2009. Proceedings, pp. 73-84, 2009, Springer, 978-3-642-04240-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Vincent Berry, François Nicolas |
Maximum Agreement and Compatible Supertrees (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 205-219, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | David Bryant |
Optimal Agreement Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JOBIM ![In: Computational Biology, First International Conference on Biology, Informatics, and Mathematics, JOBIM 2000, Montpellier, France, May 3-5, 2000, Selected Papers, pp. 24-31, 2000, Springer, 3-540-42242-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
48 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Finding Smallest Supertrees Under Minor Containment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 303-312, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
48 | Arvind Gupta, Naomi Nishimura |
finding Smallest Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings, pp. 112-121, 1995, Springer, 3-540-60573-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
45 | Stefan Grünewald, Andreas Spillner 0001, Kristoffer Forslund, Vincent Moulton |
Constructing Phylogenetic Supernetworks from Quartets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings, pp. 284-295, 2008, Springer, 978-3-540-87360-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Mukul S. Bansal, Oliver Eulenstein, André Wehe |
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(2), pp. 221-231, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computational phylogenetics, {tt NNI}, local search, gene-duplication, supertrees |
31 | Mukul S. Bansal, Oliver Eulenstein |
An Omega(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 5(4), pp. 514-524, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Algorithms, Computational Biology, Phylogenetics, Gene Duplication, Supertrees |
31 | Sagi Snir, Satish Rao |
Using Max Cut to Enhance Rooted Trees Consistency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 323-333, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
rooted triplets, semidefinite programming, Phylogenetic trees, supertrees |
26 | Feng Fu, Bo Deng, Liming Dai |
The Chromatic Entropy of Linear Supertrees and Its Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 15(11), pp. 2061, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Vladimir Makarenkov, Gayane S. Barseghyan, Nadia Tahiri |
Inferring multiple consensus trees and supertrees using clustering: a review. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.00483, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Nadia Tahiri, Bernard Fichet, Vladimir Makarenkov |
Building alternative consensus trees and supertrees using k-means and Robinson and Foulds distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 38(13), pp. 3367-3376, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Wen-Huan Wang, Jin-Xiu Zhou, Rui Sun |
On the conjecture of the r-uniform supertrees with the eight largest α-spectral radii. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 322, pp. 311-319, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Xilin Yu, Thien Le, Sarah A. Christensen, Erin K. Molloy, Tandy J. Warnow |
Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 16(1), pp. 12, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Colin Defant, Noah Kravitz, Ashwin Sah |
Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(2), pp. 2, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Lihua You, Lihong Deng, Yufei Huang |
The maximum α-spectral radius and the majorization theorem of k-uniform supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 285, pp. 663-675, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Xilin Yu, Thien Le, Sarah A. Christensen, Erin K. Molloy, Tandy J. Warnow |
Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: 20th International Workshop on Algorithms in Bioinformatics, WABI 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 15:1-15:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-161-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Li Su, Liying Kang, Honghai Li, Erfang Shan |
The Matching Polynomials and Spectral Radii of Uniform Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 25(4), pp. 4, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Pranjal Vachaspati, Tandy J. Warnow |
FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 33(5), pp. 631-639, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
26 | Honghai Li, Jia-Yu Shao, Liqun Qi 0001 |
The extremal spectral radii of k -uniform supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 32(3), pp. 741-764, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Jesper Jansson 0001, Wing-Kin Sung |
Minimal Phylogenetic Supertrees and Local Consensus Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, pp. 53:1-53:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-016-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
26 | Alexander Grigoriev, Steven Kelk, Nela Lekic |
On Low Treewidth Graphs and Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 19(1), pp. 325-343, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä |
Optimizing Phylogenetic Supertrees Using Answer Set Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.05272, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
26 | Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä |
Optimizing phylogenetic supertrees using answer set programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 15(4-5), pp. 604-619, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati |
Fixed-Parameter Algorithms for Finding Agreement Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 44(2), pp. 384-410, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
26 | Alexander Grigoriev, Steven Kelk, Nela Lekic |
On low treewidth graphs and supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.7224, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
26 | Alexander Grigoriev, Steven Kelk, Nela Lekic |
On Low Treewidth Graphs and Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AlCoB ![In: Algorithms for Computational Biology - First International Conference, AlCoB 2014, Tarragona, Spain, July 1-3, 2014, Proceedigns, pp. 71-82, 2014, Springer, 978-3-319-07952-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker |
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 67(2), pp. 142-160, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca |
Fast Local Search for Unrooted Robinson-Foulds Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 9(4), pp. 1004-1013, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati |
Fixed-Parameter Algorithms for Finding Agreement Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings, pp. 373-384, 2012, Springer, 978-3-642-31264-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | André Wehe, J. Gordon Burleigh, Oliver Eulenstein |
Algorithms for Knowledge-Enhanced Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBRA ![In: Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings, pp. 263-274, 2012, Springer, 978-3-642-30190-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Pawel Górecki 0001, J. Gordon Burleigh, Oliver Eulenstein |
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBRA ![In: Bioinformatics Research and Applications - 8th International Symposium, ISBRA 2012, Dallas, TX, USA, May 21-23, 2012. Proceedings, pp. 102-114, 2012, Springer, 978-3-642-30190-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Viet Tung Hoang, Wing-Kin Sung |
Improved Algorithms for Maximum Agreement and Compatible Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 59(2), pp. 195-214, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca |
Fast Local Search for Unrooted Robinson-Foulds Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBRA ![In: Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings, pp. 184-196, 2011, Springer, 978-3-642-21259-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Jianrong Dong, David Fernández-Baca |
Constructing Large Conservative Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics - 11th International Workshop, WABI 2011, Saarbrücken, Germany, September 5-7, 2011. Proceedings, pp. 61-72, 2011, Springer, 978-3-642-23037-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker |
FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, pp. 37-48, 2011, Springer, 978-3-642-22684-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
26 | Jianrong Dong, David Fernández-Baca, Fred R. McMorris |
Constructing majority-rule supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 5, pp. 2, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, David Fernández-Baca |
Robinson-Foulds Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 5, pp. 18, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Max Homilius, John Gordon Burleigh, Oliver Eulenstein |
Triplet-Supertrees constructed from Minimum Triplet Presentations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BICoB ![In: Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, BICoB-2010, March 24-26, 2010, Sheraton Waikiki Hotel, Honolulu, Hawaii, USA, pp. 127-132, 2010, ISCA, 978-1-880843-76-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
26 | |
Computing Rooted and Unrooted Maximum Consistent Supertrees ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0901.3299, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
26 | Cédric Chauve, Nadia El-Mabrouk |
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 13th Annual International Conference, RECOMB 2009, Tucson, AZ, USA, May 18-21, 2009. Proceedings, pp. 46-58, 2009, Springer, 978-3-642-02007-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Céline Scornavacca, Vincent Berry, Vincent Lefort, Emmanuel J. P. Douzery, Vincent Ranwez |
PhySIC_IST: cleaning source trees to infer more informative supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMC Bioinform. ![In: BMC Bioinform. 9, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Viet Tung Hoang, Wing-Kin Sung |
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0802.2867, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
26 | Vincent Berry |
On building and comparing trees Application to supertrees in phylogenetics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2008 |
RDF |
|
26 | Jeroen De Knijf |
Mining Tree Patterns with Almost Smallest Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SDM ![In: Proceedings of the SIAM International Conference on Data Mining, SDM 2008, April 24-26, 2008, Atlanta, Georgia, USA, pp. 61-71, 2008, SIAM, 978-0-89871-654-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Viet Tung Hoang, Wing-Kin Sung |
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings, pp. 361-372, 2008, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Vincent Berry, François Nicolas |
Maximum agreement and compatible supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 5(3), pp. 564-591, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson |
Minimum-Flip Supertrees: Complexity and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(2), pp. 165-173, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
tree assembly, NP-completeness, Phylogenetic tree, supertree |
26 | Francesc Rosselló, Gabriel Valiente |
An algebraic view of the relation between largest common subtrees and smallest common supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 362(1-3), pp. 33-53, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Francesc Rosselló, Gabriel Valiente |
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/cs/0604108, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
26 | Barbara R. Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton |
Imputing Supertrees and Supernetworks from Quartets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 162, 2006, Springer, 3-540-39583-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung |
Rooted Maximum Agreement Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(4), pp. 293-307, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung |
Rooted Maximum Agreement Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 499-508, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Mercè Llabrés, Francesc Rosselló, Gabriel Valiente |
On Supertrees of Phylogenetic Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Spanish Bioinformatics Conference ![In: Proceedings of the 5th Annual Spanish Bioinformatics Conference, Barcelona, Catalonia, Spain, November 29-30, 2004, pp. 142-145, 2004, Technical University of Catalonia, Barcelona, 84-7653-863-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
26 | Sebastian Böcker |
Exponentially many supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 15(7), pp. 861-865, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Roderic D. M. Page |
Modified Mincut Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 537-552, 2002, Springer, 3-540-44211-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson |
Supertrees by Flipping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 391-400, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
Finding Smallest Supertrees Under Minor Containment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 11(3), pp. 445-465, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Arvind Gupta, Naomi Nishimura |
Finding Largest Subtrees and Smallest Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 21(2), pp. 183-210, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
23 | Stephen J. Willson |
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(1), pp. 62-75, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Trees, Graph algorithms, phylogenetic tree, supertree |
23 | Peixiang Zhao 0002, Jeffrey Xu Yu |
Mining Closed Frequent Free Trees in Graph Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Advances in Databases: Concepts, Systems and Applications, 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, Bangkok, Thailand, April 9-12, 2007, Proceedings, pp. 91-102, 2007, Springer, 978-3-540-71702-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Tanmoy Kanti Das, Subhamoy Maitra |
Analysis of the "Wavelet Tree Quantization" watermarking strategy and a modified robust scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Syst. ![In: Multim. Syst. 12(2), pp. 151-163, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Cryptanalysis, Wavelet transform, Information security, Digital watermarking, Multimedia systems |
23 | Vincent Berry, François Nicolas |
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(3), pp. 289-302, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics |