A sublinear-time randomized approximation scheme for the robinson-foulds metric

被引：0

作者：

Pattengale, Nicholas D. ^{[1
]}

Moret, Bernard M. E. ^{[1
]}

机构：

[1] Department of Computer Science, University of New Mexico, Albuquerque, NM 87131, United States

来源：

Lect. Notes Comput. Sci. | 1600年 / 221-230期

关键词：

Compendex;

D O I：

10th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2006

中图分类号：

学科分类号：

摘要：

Algorithms - Approximation theory - Computer software - Java programming language - Probabilistic logics

引用

共 28 条

[21] Sublinear time approximation of the cost of a metric k-nearest neighbor graph
Czumaj, Artur
Sohler, Christian
[J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2973 - 2992
[22] Sparse harmonic transforms II: bests-term approximation guarantees for bounded orthonormal product bases in sublinear-time
Choi, Bosu
Iwen, Mark
Volkmer, Toni
[J]. NUMERISCHE MATHEMATIK, 2021, 148 (02) : 293 - 362
[23] Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time
Bosu Choi
Mark Iwen
Toni Volkmer
[J]. Numerische Mathematik, 2021, 148 : 293 - 362
[24] Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm
Eremeev A.V.
[J]. Journal of Applied and Industrial Mathematics, 2011, 5 (03) : 322 - 330
[25] A Randomized Fully Polynomial-time Approximation Scheme for Weighted Perfect Matching in the Plane
Abd El-Latif, Yasser M.
Ali, Salwa M.
Essa, Hanaa A. E.
Khamis, Soheir M.
[J]. INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2012, 3 (11) : 139 - 144
[26] A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
Karger, DR
[J]. SIAM REVIEW, 2001, 43 (03) : 499 - 522
[27] A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
Karger, DR
[J]. SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 492 - 514
[28] Haimovich-Rinnooy Kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension
Khachai, M. Yu
Ogorodnikov, Yu Yu
[J]. TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2019, 25 (04): : 235 - 248

← 1 2 3 →