Fast algorithms for computing the tripartition-based distance between phylogenetic networks

Author： Nguyen Nguyen Nguyen C. Sung Wing-Kin

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.13, Iss.3, 2007-04, pp. : 223-242

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Comparison study of two kernel-based learning algorithms for predicting the distance range between antibody interface residues and antigen surface

International Journal of Computer Mathematics, Vol. 84, Iss. 5, 2007-05 ,pp. : 697-707

Taylor & Francis Ltd

Access to resources Recommend Favorite

Morphological Erosions and Openings: Fast Algorithms Based on Anchors

By Droogenbroeck M. Buckley M.

Journal of Mathematical Imaging and Vision, Vol. 22, Iss. 2-3, 2005-05 ,pp. : 121-142

Springer Publishing Company

Access to resources Recommend Favorite

The algorithms about fast non-localmeans based image denoising

By Xing Li-li Chang Qian-shun Qiao Tian-tian

Acta Mathematicae Applicatae Sinica, Vol. 28, Iss. 2, 2012-04 ,pp. : 247-254

Springer Publishing Company

Access to resources Recommend Favorite

Fast rank algorithms based on multiscale histograms and lazy calculations

By Storozhilova M. Yurin D.

Pattern Recognition and Image Analysis, Vol. 23, Iss. 3, 2013-07 ,pp. : 367-374

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Remark on Computing Distance Functions

By Russo G. Smereka P.

Journal of Computational Physics, Vol. 163, Iss. 1, 2000-09 ,pp. : 51-67

Academic Press

Access to resources Recommend Favorite