IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1006493.html
   My bibliography  Save this article

Verbalizing phylogenomic conflict: Representation of node congruence across competing reconstructions of the neoavian explosion

Author

Listed:
  • Nico M Franz
  • Lukas J Musher
  • Joseph W Brown
  • Shizhuo Yu
  • Bertram Ludäscher

Abstract

Phylogenomic research is accelerating the publication of landmark studies that aim to resolve deep divergences of major organismal groups. Meanwhile, systems for identifying and integrating the products of phylogenomic inference–such as newly supported clade concepts–have not kept pace. However, the ability to verbalize node concept congruence and conflict across multiple, in effect simultaneously endorsed phylogenomic hypotheses, is a prerequisite for building synthetic data environments for biological systematics and other domains impacted by these conflicting inferences. Here we develop a novel solution to the conflict verbalization challenge, based on a logic representation and reasoning approach that utilizes the language of Region Connection Calculus (RCC–5) to produce consistent alignments of node concepts endorsed by incongruent phylogenomic studies. The approach employs clade concept labels to individuate concepts used by each source, even if these carry identical names. Indirect RCC–5 modeling of intensional (property-based) node concept definitions, facilitated by the local relaxation of coverage constraints, allows parent concepts to attain congruence in spite of their differentially sampled children. To demonstrate the feasibility of this approach, we align two recent phylogenomic reconstructions of higher-level avian groups that entail strong conflict in the "neoavian explosion" region. According to our representations, this conflict is constituted by 26 instances of input "whole concept" overlap. These instances are further resolvable in the output labeling schemes and visualizations as "split concepts", which provide the labels and relations needed to build truly synthetic phylogenomic data environments. Because the RCC–5 alignments fundamentally reflect the trained, logic-enabled judgments of systematic experts, future designs for such environments need to promote a culture where experts routinely assess the intensionalities of node concepts published by our peers–even and especially when we are not in agreement with each other.Author summary: Synthetic platforms for phylogenomic knowledge tend to manage conflict between different evolutionary reconstructions in the following way: "If we do not agree, then it is either our view over yours, or we just collapse all conflicting node concepts into polytomies". We argue that this is not an equitable way to realize synthesis in this domain. For instance, it would not be an adequate solution for building a unified data environment where authors can endorse and yet also reconcile their diverging perspectives, side by side. Hence, we develop a novel system for verbalizing–i.e., consistently identifying and aligning–incongruent node concepts that reflects a more forward-looking attitude: "We may not agree with you, but nevertheless we understand your phylogenomic inference well enough to express our disagreements in a logic-compatible syntax. We can therefore maximize the translatability of data linked to our diverging phylogenomic hypotheses". We show that achieving phylogenomic synthesis fundamentally depends on the application of trained expert judgment to assert parent node congruence in spite of incongruently sampled children.

Suggested Citation

  • Nico M Franz & Lukas J Musher & Joseph W Brown & Shizhuo Yu & Bertram Ludäscher, 2019. "Verbalizing phylogenomic conflict: Representation of node congruence across competing reconstructions of the neoavian explosion," PLOS Computational Biology, Public Library of Science, vol. 15(2), pages 1-36, February.
  • Handle: RePEc:plo:pcbi00:1006493
    DOI: 10.1371/journal.pcbi.1006493
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1006493
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1006493&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1006493?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pcbi00:1006493. 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: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    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.