Matches in SemOpenAlex for { <https://semopenalex.org/work/W1549202508> ?p ?o ?g. }
Showing items 1 to 89 of
89
with 100 items per page.
- W1549202508 endingPage "232" @default.
- W1549202508 startingPage "217" @default.
- W1549202508 abstract "Phylogenetic networks are models of evolution that go beyond trees, allowing biological operations that are not consistent with tree-like evolution. One of the most important of these biological operations is recombination between two sequences (homologous chromosomes). The algorithmic problem of reconstructing a history of recombinations, or determining the minimum number of recombinations needed, has been studied in a number of papers [10, 11, 12, 23, 24, 25, 16, 13, 14, 6, 9, 8, 18, 19, 15, 1]. In [9, 6, 10, 8, 1] we introduced and used “conflict graphs” and “incompatibility graphs” to compute lower bounds on the minimum number of recombinations needed, and to efficiently solve constrained cases of the minimization problem. In those results, the non-trivial connected components of the graphs were the key features that were used. In this paper we more fully develop the structural importance of non-trivial connected components of the incompatibility graph, to establish a fundamental decomposition theorem about phylogenetic networks. The result applies to phylogenetic networks where cycles reflect biological phenomena other than recombination, such as recurrent mutation and lateral gene transfer. The proof leads to an efficient O(nm 2) time algorithm to find the underlying maximal tree structure defined by the decomposition, for any set of n sequences of length m each. An implementation of that algorithm is available. We also report on progress towards resolving the major open problem in this area." @default.
- W1549202508 created "2016-06-24" @default.
- W1549202508 creator A5040822940 @default.
- W1549202508 creator A5062896251 @default.
- W1549202508 date "2005-01-01" @default.
- W1549202508 modified "2023-09-26" @default.
- W1549202508 title "A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters" @default.
- W1549202508 cites W1533415092 @default.
- W1549202508 cites W1830906757 @default.
- W1549202508 cites W1987646246 @default.
- W1549202508 cites W1997945171 @default.
- W1549202508 cites W2007850812 @default.
- W1549202508 cites W2037655215 @default.
- W1549202508 cites W2045727226 @default.
- W1549202508 cites W2049931279 @default.
- W1549202508 cites W2054547415 @default.
- W1549202508 cites W2072362336 @default.
- W1549202508 cites W2074507113 @default.
- W1549202508 cites W2096967818 @default.
- W1549202508 cites W2110570734 @default.
- W1549202508 cites W2116652744 @default.
- W1549202508 cites W2118780696 @default.
- W1549202508 cites W2124253802 @default.
- W1549202508 cites W2143424400 @default.
- W1549202508 cites W938539187 @default.
- W1549202508 doi "https://doi.org/10.1007/11415770_17" @default.
- W1549202508 hasPublicationYear "2005" @default.
- W1549202508 type Work @default.
- W1549202508 sameAs 1549202508 @default.
- W1549202508 citedByCount "55" @default.
- W1549202508 countsByYear W15492025082012 @default.
- W1549202508 countsByYear W15492025082013 @default.
- W1549202508 countsByYear W15492025082014 @default.
- W1549202508 countsByYear W15492025082018 @default.
- W1549202508 countsByYear W15492025082019 @default.
- W1549202508 countsByYear W15492025082020 @default.
- W1549202508 countsByYear W15492025082021 @default.
- W1549202508 crossrefType "book-chapter" @default.
- W1549202508 hasAuthorship W1549202508A5040822940 @default.
- W1549202508 hasAuthorship W1549202508A5062896251 @default.
- W1549202508 hasConcept C104317684 @default.
- W1549202508 hasConcept C113174947 @default.
- W1549202508 hasConcept C11413529 @default.
- W1549202508 hasConcept C114614502 @default.
- W1549202508 hasConcept C124681953 @default.
- W1549202508 hasConcept C177264268 @default.
- W1549202508 hasConcept C18903297 @default.
- W1549202508 hasConcept C193252679 @default.
- W1549202508 hasConcept C199360897 @default.
- W1549202508 hasConcept C26619641 @default.
- W1549202508 hasConcept C33923547 @default.
- W1549202508 hasConcept C41008148 @default.
- W1549202508 hasConcept C55493867 @default.
- W1549202508 hasConcept C80444323 @default.
- W1549202508 hasConcept C86803240 @default.
- W1549202508 hasConceptScore W1549202508C104317684 @default.
- W1549202508 hasConceptScore W1549202508C113174947 @default.
- W1549202508 hasConceptScore W1549202508C11413529 @default.
- W1549202508 hasConceptScore W1549202508C114614502 @default.
- W1549202508 hasConceptScore W1549202508C124681953 @default.
- W1549202508 hasConceptScore W1549202508C177264268 @default.
- W1549202508 hasConceptScore W1549202508C18903297 @default.
- W1549202508 hasConceptScore W1549202508C193252679 @default.
- W1549202508 hasConceptScore W1549202508C199360897 @default.
- W1549202508 hasConceptScore W1549202508C26619641 @default.
- W1549202508 hasConceptScore W1549202508C33923547 @default.
- W1549202508 hasConceptScore W1549202508C41008148 @default.
- W1549202508 hasConceptScore W1549202508C55493867 @default.
- W1549202508 hasConceptScore W1549202508C80444323 @default.
- W1549202508 hasConceptScore W1549202508C86803240 @default.
- W1549202508 hasLocation W15492025081 @default.
- W1549202508 hasOpenAccess W1549202508 @default.
- W1549202508 hasPrimaryLocation W15492025081 @default.
- W1549202508 hasRelatedWork W1979781836 @default.
- W1549202508 hasRelatedWork W2104709006 @default.
- W1549202508 hasRelatedWork W2295960879 @default.
- W1549202508 hasRelatedWork W2800044728 @default.
- W1549202508 hasRelatedWork W2899590372 @default.
- W1549202508 hasRelatedWork W2910230320 @default.
- W1549202508 hasRelatedWork W2964970368 @default.
- W1549202508 hasRelatedWork W3088015816 @default.
- W1549202508 hasRelatedWork W3106839334 @default.
- W1549202508 hasRelatedWork W4287661213 @default.
- W1549202508 isParatext "false" @default.
- W1549202508 isRetracted "false" @default.
- W1549202508 magId "1549202508" @default.
- W1549202508 workType "book-chapter" @default.