|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
153 | Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(2), pp. 377-395, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Quartet distance, Distance measures, Evolutionary trees, Hierarchical decompositions |
118 | Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 731-742, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
104 | Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers |
Computing the Quartet Distance Between Trees of Arbitrary Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 77-88, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
85 | Mukul S. Bansal, Jianrong Dong, David Fernández-Baca |
Comparing and Aggregating Partially Resolved Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 72-83, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Magnus Bordewich, Olivier Gascuel, Katharina T. Huber, Vincent Moulton |
Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(1), pp. 110-117, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
subtree prune and regraft (SPR), BSPR algorithm, Nearest Neighbor Interchange (NNI), BNNI algorithm, balanced minimum evolution principle (BME), tree-length, quartet-distance, Robinson Foulds distance, safety radius, topological move, consistency, phylogenetic tree |
27 | Sagi Snir, Osnat Weissberg, Raphael Yuster |
On the quartet distance given partial information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 100(2), pp. 252-269, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
27 | Sagi Snir, Osnat Weissberg, Raphael Yuster |
On the quartet distance given partial information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.13101, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
27 | Bartlomiej Dudek 0001, Pawel Gawrychowski |
Computing quartet distance is equivalent to counting 4-cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019., pp. 733-743, 2019, ACM, 978-1-4503-6705-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
27 | Bartlomiej Dudek 0001, Pawel Gawrychowski |
Computing Quartet Distance is Equivalent to Counting 4-Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.06244, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
27 | Noga Alon, Humberto Naves, Benny Sudakov |
On the Maximum Quartet Distance between Phylogenetic Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(2), pp. 718-735, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
27 | Noga Alon, Humberto Naves, Benny Sudakov |
On the maximum quartet distance between phylogenetic trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp. 2095-2106, 2016, SIAM, 978-1-61197-433-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
27 | Noga Alon, Humberto Naves, Benny Sudakov |
On the maximum quartet distance between phylogenetic trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.04344, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
27 | Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand |
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 1814-1832, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
27 | Ralph W. Crosby, Tiffani L. Williams |
A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees. ![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. 60-71, 2012, Springer, 978-3-642-30190-2. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
27 | Jesper Buus Nielsen, Anders K. Kristensen, Thomas Mailund, Christian N. S. Pedersen |
A sub-cubic time algorithm for computing the quartet distance between two general trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 6, pp. 15, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Mailund, Jesper Buus Nielsen, Christian N. S. Pedersen |
A Quadratic Time Algorithm for Computing the Quartet Distance between Two General Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCBS ![In: International Joint Conferences on Bioinformatics, Systems Biology and Intelligent Computing, IJCBS 2009, Shanghai, China, 3-5 August 2009, pp. 565-568, 2009, IEEE Computer Society, 978-0-7695-3739-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
27 | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg |
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Bioinform. Comput. Biol. ![In: J. Bioinform. Comput. Biol. 6(1), pp. 37-50, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg |
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APBC ![In: Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China, pp. 91-100, 2007, Imperial College Press, 978-1-86094-783-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
27 | Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg |
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APBC ![In: Proceedings of 5th Asia-Pacific Bioinformatics Conference, APBC 2007, 15-17 January 2007, Hong Kong, China, pp. 101-110, 2007, Imperial College Press, 978-1-86094-783-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
27 | Chris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers, Martin Stig Stissing |
Fast calculation of the quartet distance between trees of arbitrary degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 1, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Thomas Mailund, Christian N. S. Pedersen |
QDist-quartet distance between evolutionary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 20(10), pp. 1636-1637, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | David Bryant, John Tsang, Paul E. Kearney, Ming Li 0001 |
Computing the quartet distance between evolutionary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA., pp. 285-286, 2000, ACM/SIAM, 0-89871-453-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
Displaying result #1 - #22 of 22 (100 per page; Change: )
|
|