FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2922595539> ?p ?o ?g. }

• W2922595539 abstract "Phylogenetics is the study of evolutionary relationships between biological entities; phylogenetic trees (phylogenies) are a visualization of these evolutionary relationships. Accurate approaches to reconstruct hylogenies from sequence data usually result in NPhard optimization problems, hence local search heuristics have to be applied in practice. These methods are highly accurate and fast enough as long as the input data is not too large. Divide-and-conquer techniques are a promising approach to boost scalability and accuracy of those local search heuristics on very large datasets. A divide-and-conquer method breaks down a large phylogenetic problem into smaller sub-problems that are computationally easier to solve. The sub-problems (overlapping trees) are then combined using a supertree method. Supertree methods merge a set of overlapping phylogenetic trees into a supertree containing all taxa of the input trees. The challenge in supertree reconstruction is the way of dealing with conflicting information in the input trees. Many different algorithms for different objective functions have been suggested to resolve these conflicts. In particular, there are methods that encode the source trees in a matrix and the supertree is constructed applying a local search heuristic to optimize the respective objective function. The most widely used supertree methods use such local search heuristics. However, to really improve the scalability of accurate tree reconstruction by divide-and-conquer approaches, accurate polynomial time methods are needed for the supertree reconstruction step. In this work, we present approaches for accurate polynomial time supertree reconstruction in particular Bad Clade Deletion (BCD), a novel heuristic supertree algorithm with polynomial running time. BCD uses minimum cuts to greedily delete a locally minimal number of columns from a matrix representation to make it compatible. Different from local search heuristics, it guarantees to return the directed perfect phylogeny for the input matrix, corresponding to the parent tree of the input trees if one exists. BCD can take support values of the source trees into account without an increase in complexity. We show how reliable clades can be used to restrict the search space for BCD and how those clades can be collected from the input data using the Greedy Strict Consensus Merger. Finally, we introduce a beam search extension for the BCD algorithm that keeps alive a constant number of partial solutions in each top-down iteration phase. The guaranteed worst-case running time of BCD with beam search extension is still polynomial. We present an exact and a randomized subroutine to generate suboptimal partial solutions. In our thorough evaluation on several simulated and biological datasets against a representative set of supertree methods we found that BCD is more accurate than the most accurate supertree methods when using support values and search space restriction on simulated data. Simultaneously BCD is faster than any other evaluated method. The beam search approach improved the accuracy of BCD on all evaluated datasets at the cost of speed. We found that BCD supertrees can boost maximum likelihood tree reconstruction when used as starting tree. Further, BCD could handle large scale datasets where local search heuristics did not converge in reasonable time. Due to its combination of speed, accuracy, and the ability to reconstruct the parent tree if one exists, BCD is a promising approach to enable outstanding scalability of divide-and-conquer approaches." @default.
• W2922595539 created "2019-04-01" @default.
• W2922595539 creator A5088307823 @default.
• W2922595539 date "2018-01-01" @default.
• W2922595539 modified "2023-09-27" @default.
• W2922595539 title "Fast and accurate supertrees: towards large scale phylogenies" @default.
• W2922595539 doi "https://doi.org/10.22032/dbt.35164" @default.
• W2922595539 hasPublicationYear "2018" @default.
• W2922595539 type Work @default.
• W2922595539 sameAs 2922595539 @default.
• W2922595539 citedByCount "0" @default.
• W2922595539 crossrefType "dissertation" @default.
• W2922595539 hasAuthorship W2922595539A5088307823 @default.
• W2922595539 hasConcept C104317684 @default.
• W2922595539 hasConcept C111919701 @default.
• W2922595539 hasConcept C113174947 @default.
• W2922595539 hasConcept C11413529 @default.
• W2922595539 hasConcept C114614502 @default.
• W2922595539 hasConcept C119857082 @default.
• W2922595539 hasConcept C127705205 @default.
• W2922595539 hasConcept C154945302 @default.
• W2922595539 hasConcept C173801870 @default.
• W2922595539 hasConcept C193252679 @default.
• W2922595539 hasConcept C33923547 @default.
• W2922595539 hasConcept C41008148 @default.
• W2922595539 hasConcept C48044578 @default.
• W2922595539 hasConcept C55493867 @default.
• W2922595539 hasConcept C55919133 @default.
• W2922595539 hasConcept C71559656 @default.
• W2922595539 hasConcept C77088390 @default.
• W2922595539 hasConcept C80444323 @default.
• W2922595539 hasConcept C86803240 @default.
• W2922595539 hasConceptScore W2922595539C104317684 @default.
• W2922595539 hasConceptScore W2922595539C111919701 @default.
• W2922595539 hasConceptScore W2922595539C113174947 @default.
• W2922595539 hasConceptScore W2922595539C11413529 @default.
• W2922595539 hasConceptScore W2922595539C114614502 @default.
• W2922595539 hasConceptScore W2922595539C119857082 @default.
• W2922595539 hasConceptScore W2922595539C127705205 @default.
• W2922595539 hasConceptScore W2922595539C154945302 @default.
• W2922595539 hasConceptScore W2922595539C173801870 @default.
• W2922595539 hasConceptScore W2922595539C193252679 @default.
• W2922595539 hasConceptScore W2922595539C33923547 @default.
• W2922595539 hasConceptScore W2922595539C41008148 @default.
• W2922595539 hasConceptScore W2922595539C48044578 @default.
• W2922595539 hasConceptScore W2922595539C55493867 @default.
• W2922595539 hasConceptScore W2922595539C55919133 @default.
• W2922595539 hasConceptScore W2922595539C71559656 @default.
• W2922595539 hasConceptScore W2922595539C77088390 @default.
• W2922595539 hasConceptScore W2922595539C80444323 @default.
• W2922595539 hasConceptScore W2922595539C86803240 @default.
• W2922595539 hasLocation W29225955391 @default.
• W2922595539 hasOpenAccess W2922595539 @default.
• W2922595539 hasPrimaryLocation W29225955391 @default.
• W2922595539 hasRelatedWork W115779656 @default.
• W2922595539 hasRelatedWork W1481511786 @default.
• W2922595539 hasRelatedWork W1488122010 @default.
• W2922595539 hasRelatedWork W1529253538 @default.
• W2922595539 hasRelatedWork W1665415792 @default.
• W2922595539 hasRelatedWork W1984712439 @default.
• W2922595539 hasRelatedWork W2103513093 @default.
• W2922595539 hasRelatedWork W2105246678 @default.
• W2922595539 hasRelatedWork W2118804068 @default.
• W2922595539 hasRelatedWork W2152188199 @default.
• W2922595539 hasRelatedWork W2156644391 @default.
• W2922595539 hasRelatedWork W2170849167 @default.
• W2922595539 hasRelatedWork W2179503016 @default.
• W2922595539 hasRelatedWork W2566588687 @default.
• W2922595539 hasRelatedWork W2754271170 @default.
• W2922595539 hasRelatedWork W2891895300 @default.
• W2922595539 hasRelatedWork W2996919918 @default.
• W2922595539 hasRelatedWork W3091954686 @default.
• W2922595539 hasRelatedWork W3134020583 @default.
• W2922595539 hasRelatedWork W3200924559 @default.
• W2922595539 isParatext "false" @default.
• W2922595539 isRetracted "false" @default.
• W2922595539 magId "2922595539" @default.
• W2922595539 workType "dissertation" @default.