Minimal Triangulation Algorithms for Perfect Phylogeny Problems
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-319-04921-2_34
Reference31 articles.
1. Agarwala, R., Fernández-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM Journal on Computing 23, 1216–1224 (1994)
2. Berry, A., Bordat, J., Cogis, O.: Generating all the minimal separators of a graph. International Journal of Foundations of Computer Science 11(3), 397–403 (2000)
3. Bininda-Emonds, O.R.: The evolution of supertrees. Trends in Ecology and Evolution 19(6), 315–322 (2004)
4. Blair, J., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, J., Gilbert, J., Liu, J.H. (eds.) Graph Theory and Sparse Matrix Computations, IMA Volumes in Mathematics and its Applications, vol. 56, pp. 1–27. Springer (1993)
5. Bodlaender, H., Heggernes, P., Villanger, Y.: Faster parameterized algorithms for minimum fill–in. Algorithmica 61, 817–838 (2011)
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Finding Optimal Triangulations Parameterized by Edge Clique Cover;Algorithmica;2022-02-05
2. Solving Graph Problems via Potential Maximal Cliques;ACM Journal of Experimental Algorithmics;2019-12-17
3. Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques;Algorithmica;2017-02-27
4. Approximately counting locally-optimal structures;Journal of Computer and System Sciences;2016-09
5. Approximately Counting Locally-Optimal Structures;Automata, Languages, and Programming;2015
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3