Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Simone Linz"'
Publikováno v:
Evolutionary Bioinformatics, Vol 3, Pp 86-98 (2007)
Hybridization is an important evolutionary process for many groups of species. Thus, conflicting signals in a data set may not be the result of sampling or modeling errors, but due to the fact that hybridization has played a significant role in the e
Externí odkaz:
https://doaj.org/article/82415ca15e654be982fb45e628015177
Publikováno v:
Annals of Operations Research, 309(1), 425-451. Springer
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. Here we explore the practical impact of kernelization (i.e. data reduction) on the NP-hard problem of computing the TBR distance between two unrooted binary phylogenet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::888463200cba8fc7e63b43a9a5899c25
https://doi.org/10.1007/s10479-021-04352-1
https://doi.org/10.1007/s10479-021-04352-1
Autor:
Magnus Bordewich, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke
Publikováno v:
SIAM Journal on Discrete Mathematics, 2022, Vol.36(1), pp.336-354 [Peer Reviewed Journal]
We give a counterexample to the conjecture of Martin and Thatte that two balanced rooted binary leaf-labelled trees on $n$ leaves have a maximum agreement subtree (MAST) of size at least $n^{\frac{1}{2}}$. In particular, we show that for any $c>0$, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fae03134e3ee8c89a9e2743c92a65fc
https://doi.org/10.1137/20m1379678
https://doi.org/10.1137/20m1379678
Publikováno v:
Information Processing Letters, 180:106336. Elsevier Science
The rooted subtree prune and regraft (rSPR) distance between two rooted binary phylogenetic trees is a well-studied measure of topological dissimilarity that is NP-hard to compute. Here we describe an improved linear kernel for the problem. In partic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24868cf3418ad3aa7a5ea99da0fde485
https://cris.maastrichtuniversity.nl/en/publications/6a06050b-9cd9-4877-8c57-dc4f8ecdfdbf
https://cris.maastrichtuniversity.nl/en/publications/6a06050b-9cd9-4877-8c57-dc4f8ecdfdbf
Autor:
Simone Linz, Steven Kelk
Publikováno v:
Annals of Combinatorics, 24(3), 475-502. Birkhauser Verlag Basel
Recently it was shown that, if the subtree and chain reduction rules have been applied exhaustively to two unrooted phylogenetic trees, the reduced trees will have at most 15k-9 taxa where k is the TBR (Tree Bisection and Reconnection) distance betwe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9560f3c59bff0c10390a05dfd4129c98
https://doi.org/10.1007/s00026-020-00502-7
https://doi.org/10.1007/s00026-020-00502-7
Publikováno v:
Scopus-Elsevier
This paper proposes a new practical method for the weighted region problem (WRP). The objective of WRP is to find a minimum cost path between two vertices among different regions where each region incurs a traversal cost per unit distance. Currently,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d0633116fff0017d29c5e75bc3012a0
https://doi.org/10.1609/icaps.v30i1.6673
https://doi.org/10.1609/icaps.v30i1.6673
Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs that are widely used to represent the evolutionary relationships between entities such as species, languages, cancer cells, and viruses. To reconstruct and analyze phylogenetic ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9123f3584fa625e3fabedc35121c1de
http://arxiv.org/abs/2202.11234
http://arxiv.org/abs/2202.11234
Publikováno v:
Discrete Applied Mathematics, 260, 131-143. Elsevier
Discrete Applied Mathematics, 260
Discrete Applied Mathematics, 260
Here we show that deciding whether two rooted binary phylogenetic trees on the same set of taxa permit a cherry-picking sequence, a special type of elimination order on the taxa, is NP-complete. This improves on an earlier result which proved hardnes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::926e6f933ab99fa44944fc30924c323e
https://doi.org/10.1016/j.dam.2019.01.031
https://doi.org/10.1016/j.dam.2019.01.031
Autor:
Simone Linz, Steven Kelk
Publikováno v:
Siam Journal on Discrete Mathematics, 33(3), 1556-1574. SIAM Publications
In 2001 Allen and Steel showed that, if subtree and chain reduction rules have been applied to two unrooted phylogenetic trees, the reduced trees will have at most 28k taxa where k is the TBR (Tree Bisection and Reconnection) distance between the two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e428311dd1f98c0d0ca119fd8dad1e45
https://doi.org/10.1137/18m122724x
https://doi.org/10.1137/18m122724x
Publikováno v:
SIGSPATIAL/GIS
This paper proposes an efficient method for the weighted region problem (WRP) on the surface of three-dimensional terrains. WRP is a classical path planning problem, asking for the minimum cost path between two given points crossing different regions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6b5eb219d9db928bd8367d48fb81ce5
https://doi.org/10.1145/3397536.3422216
https://doi.org/10.1145/3397536.3422216