tailieunhanh - Báo cáo sinh học: "Fast calculation of the quartet distance between trees of arbitrary degrees"

Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: Fast calculation of the quartet distance between trees of arbitrary degrees. | Algorithms for Molecular Biology BioMed Central Research Open Access Fast calculation of the quartet distance between trees of arbitrary degrees Chris Christiansen1 Thomas Mailund 2 Christian NS Pedersen 1 3 Martin Randers1 and Martin Stig Stissing1 Address Department of Computer Science University of Aarhus Aabogade 34 DK-8200 Ẵrhus N Denmark 2Department of Statistics University of Oxford 1 South Parks Road Oxford OX1 3TG UK and 3Bioinformatics Research Center University of Aarhus H0egh-Guldbergsgade 10 Bldg. 090 DK-8000 Ẵrhus C Denmark Email Chris Christiansen - chrisc@ Thomas Mailund - mailund@ Christian NS Pedersen - cstorm@ Martin Randers - Martin Stig Stissing - stissing@ Corresponding authors Published 25 September 2006 Received 18 May 2006 .r. . J. Accepted 25 September 2006 Algorithms for Molecular Biology 2006 1 16 doi 1748-7188-1-16 This article is available from http content l l l6 2006 Christiansen et al licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License http licenses by which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Abstract Background A number of algorithms have been developed for calculating the quartet distance between two evolutionary trees on the same set of species. The quartet distance is the number of quartets - sub-trees induced by four leaves - that differs between the trees. Mostly these algorithms are restricted to work on binary trees but recently we have developed algorithms that work on trees of arbitrary degree. Results We present a fast algorithm for computing the quartet distance between trees of arbitrary degree. Given input trees T and T the algorithm runs in time O n V - min id id and space O n V where n is the number of leaves in the two trees V and V are the .

• Báo cáo khoa học
• Báo cáo sinh học hay
• cách trình bày báo cáo
• báo cáo sinh học
• công trình nghiên cứu sinh học
• tài liệu về sinh học