![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Megan Owen
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Magnus Bordewich
, Simone Linz
, Megan Owen, Katherine St. John, Charles Semple
, Kristina Wicke
:
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36(1): 336-354 (2022) - 2021
- [j11]Nathan Davidov, Amanda Hernandez, Justin Jian, Patrick McKenna, K. A. Medlin, Roadra Mojumder, Megan Owen, Andrew Quijano, Amanda Rodriguez, Katherine St. John, Katherine Thai, Meliza Uraga:
Maximum Covering Subtrees for Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2823-2827 (2021) - 2020
- [j10]Maria Anaya, Olga Anipchenko-Ulaj, Aisha Ashfaq, Joyce Chiu, Mahedi Kaiser, Max Shoji Ohsawa, Megan Owen, Ella Pavlechko
, Katherine St. John, Shivam Suleria, Keith Thompson, Corrine Yap:
Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace. Adv. Appl. Math. 120: 102072 (2020) - [j9]Anna Lubiw, Daniela Maftuleac, Megan Owen:
Shortest paths and convex hulls in 2D complexes with non-positive curvature. Comput. Geom. 89: 101626 (2020) - [i9]Nathan Davidov, Amanda Hernandez, Justin Jian, Patrick McKenna, K. A. Medlin, Roadra Mojumder, Megan Owen, Andrew Quijano, Amanda Rodriguez, Katherine St. John, Katherine Thai, Meliza Uraga:
Covering Tree-Based Phylogenetic Networks. CoRR abs/2009.12413 (2020)
2010 – 2019
- 2019
- [j8]Gillian Grindstaff
, Megan Owen:
Representations of Partial Leaf Sets in Phylogenetic Tree Space. SIAM J. Appl. Algebra Geom. 3(4): 691-720 (2019) - 2018
- [i8]Gillian Grindstaff, Megan Owen:
Geometric comparison of phylogenetic trees with different leaf sets. CoRR abs/1807.04235 (2018) - 2016
- [i7]Maria Anaya, Olga Anipchenko-Ulaj, Aisha Ashfaq, Joyce Chiu, Mahedi Kaiser, Max Shoji Ohsawa, Megan Owen, Ella Pavlechko, Katherine St. John, Shivam Suleria, Keith Thompson, Corrine Yap:
On Determining if Tree-based Networks Contain Fixed Trees. CoRR abs/1602.02739 (2016) - [i6]Anna Lubiw, Daniela Maftuleac, Megan Owen:
Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature. CoRR abs/1603.00847 (2016) - 2015
- [j7]Ezra Miller, Megan Owen, J. Scott Provan:
Polyhedral computational geometry for averaging metric phylogenetic trees. Adv. Appl. Math. 68: 51-91 (2015) - [j6]Aasa Feragen
, Jens Petersen
, Megan Owen, Pechin Lo, Laura Hohwu Thomsen, Mathilde Marie Winkler Wille, Asger Dirksen, Marleen de Bruijne
:
Geodesic Atlas-Based Labeling of Anatomical Trees: Application and Evaluation on Airways Extracted From CT. IEEE Trans. Medical Imaging 34(6): 1212-1226 (2015) - 2014
- [j5]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A note on the unsolvability of the weighted region shortest path problem. Comput. Geom. 47(7): 724-727 (2014) - [j4]Sean Skwerer, Elizabeth Bullitt, Stephan Huckemann, Ezra Miller, Ipek Oguz, Megan Owen, Vic Patrangenaru, J. Scott Provan, J. S. Marron:
Tree-Oriented Analysis of Brain Artery Structure. J. Math. Imaging Vis. 50(1-2): 126-143 (2014) - 2013
- [c2]Aasa Feragen
, Megan Owen, Jens Petersen
, Mathilde M. W. Wille, Laura H. Thomsen, Asger Dirksen, Marleen de Bruijne
:
Tree-Space Statistics and Approximations for Large-Scale Analysis of Anatomical Trees. IPMI 2013: 74-85 - [i5]Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari, Megan Owen, Michiel H. M. Smid:
A Note on the Unsolvability of the Weighted Region Shortest Path Problem. CoRR abs/1305.5209 (2013) - 2012
- [j3]Federico Ardila, Megan Owen, Seth Sullivant
:
Geodesics in CAT(0) cubical complexes. Adv. Appl. Math. 48(1): 142-163 (2012) - [c1]Aasa Feragen
, Jens Petersen
, Megan Owen, Pechin Lo, Laura H. Thomsen, Mathilde M. W. Wille, Asger Dirksen, Marleen de Bruijne
:
A Hierarchical Scheme for Geodesic Anatomical Labeling of Airway Trees. MICCAI (3) 2012: 147-155 - [i4]Ezra Miller, Megan Owen, J. Scott Provan:
Averaging metric phylogenetic trees. CoRR abs/1211.7046 (2012) - 2011
- [j2]Megan Owen:
Computing Geodesic Distances in Tree Space. SIAM J. Discret. Math. 25(4): 1506-1529 (2011) - [j1]Megan Owen, J. Scott Provan:
A Fast Algorithm for Computing Geodesic Distances in Tree Space. IEEE ACM Trans. Comput. Biol. Bioinform. 8(1): 2-13 (2011) - [i3]Federico Ardila, Megan Owen, Seth Sullivant:
Geodesics in CAT(0) Cubical Complexes. CoRR abs/1101.2428 (2011)
2000 – 2009
- 2009
- [i2]Megan Owen:
Computing Geodesic Distances in Tree Space. CoRR abs/0903.0696 (2009) - [i1]Megan Owen, J. Scott Provan:
A Fast Algorithm for Computing Geodesic Distances in Tree Space. CoRR abs/0907.3942 (2009)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint