Computing quartet distance is equivalent to counting 4-cycles-Reference-Cited by-同舟云学术

Computing quartet distance is equivalent to counting 4-cycles

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Dudek Bartłomiej¹,Gawrychowski Paweł¹

Affiliation:

1. University of Wrocław, Poland

Funder

Narodowe Centrum Nauki

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316390

Reference65 articles.

1. Amir Abboud and Virginia Vassilevska Williams. 2014. Amir Abboud and Virginia Vassilevska Williams. 2014.

2. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In FOCS. IEEE Computer Society 434–443. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In FOCS. IEEE Computer Society 434–443.

3. Matching Triangles and Basing Hardness on an Extremely Popular Conjecture

4. Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees

5. Noga Alon Humberto Naves and Benny Sudakov. 2016. Noga Alon Humberto Naves and Benny Sudakov. 2016.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time;ACM Transactions on Algorithms;2023-12-10

2. Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Cache Oblivious Algorithms for Computing the Triplet Distance between Trees;ACM Journal of Experimental Algorithmics;2021-12-31

4. Triplet-based similarity score for fully multilabeled trees with poly-occurring labels;Bioinformatics;2020-07-30