IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v19y2010i1d10.1007_s10878-008-9164-y.html
   My bibliography  Save this article

Linear time construction of 5-phylogenetic roots for tree chordal graphs

Author

Listed:
  • William S. Kennedy

    (McGill University)

  • Hui Kong

    (Academy of Mathematics and Systems Science)

  • Guohui Lin

    (University of Alberta)

  • Guiying Yan

    (Academy of Mathematics and Systems Science)

Abstract

Inspired by phylogenetic tree construction in computational biology, Lin et al. (The 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), pp. 539–551, 2000) introduced the notion of a k -phylogenetic root. A k-phylogenetic root of a graph G is a tree T such that the leaves of T are the vertices of G, two vertices are adjacent in G precisely if they are within distance k in T, and all non-leaf vertices of T have degree at least three. The k-phylogenetic root problem is to decide whether such a tree T exists for a given graph G. In addition to introducing this problem, Lin et al. designed linear time constructive algorithms for k≤4, while left the problem open for k≥5. In this paper, we partially fill this hole by giving a linear time constructive algorithm to decide whether a given tree chordal graph has a 5-phylogenetic root; this is the largest class of graphs known to have such a construction.

Suggested Citation

  • William S. Kennedy & Hui Kong & Guohui Lin & Guiying Yan, 2010. "Linear time construction of 5-phylogenetic roots for tree chordal graphs," Journal of Combinatorial Optimization, Springer, vol. 19(1), pages 94-106, January.
    • Handle: RePEc:spr:jcomop:v:19:y:2010:i:1:d:10.1007_s10878-008-9164-y
    DOI: 10.1007/s10878-008-9164-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-008-9164-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-008-9164-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:19:y:2010:i:1:d:10.1007_s10878-008-9164-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.