An improved algorithm for tree edit distance with applications for RNA secondary structure comparison

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.27, Iss.4, 2014-05, pp. : 778-797

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

Related content

Applying an edit distance to the matching of tree ring sequences in dendrochronology

By Wenk C.

Journal of Discrete Algorithms, Vol. 1, Iss. 5, 2003-10 ,pp. : 367-385

Elsevier

Access to resources Recommend Favorite

How Hard Is Computing the Edit Distance?

By Pighizzini G.

Information and Computation, Vol. 165, Iss. 1, 2001-02 ,pp. : 1-13

Academic Press

Access to resources Recommend Favorite

An Improved Approximation Algorithm for Multicast k-Tree Routing

By Lin Guohui

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 349-356

Springer Publishing Company

Access to resources Recommend Favorite

An improved genetic algorithm and its applications to the optimisation design of an aspirated compressor profile

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, Vol. 79, Iss. 12, 2015-12 ,pp. : 640-653

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the average distance of the hypercube tree

By Alsuwaiyel M. H.

International Journal of Computer Mathematics, Vol. 87, Iss. 6, 2010-05 ,pp. : 1208-1216

Taylor & Francis Ltd

Access to resources Recommend Favorite