120 related articles for article (PubMed ID: 30295620)
1. Edit Distance between Merge Trees.
Sridharamurthy R; Masood TB; Kamakshidasan A; Natarajan V
IEEE Trans Vis Comput Graph; 2020 Mar; 26(3):1518-1531. PubMed ID: 30295620
[TBL] [Abstract][Full Text] [Related]
2. Comparative Analysis of Merge Trees Using Local Tree Edit Distance.
Sridharamurthy R; Natarajan V
IEEE Trans Vis Comput Graph; 2023 Feb; 29(2):1518-1530. PubMed ID: 34699362
[TBL] [Abstract][Full Text] [Related]
3. A Structural Average of Labeled Merge Trees for Uncertainty Visualization.
Yan L; Wang Y; Munch E; Gasparovic E; Wang B
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):832-842. PubMed ID: 31403426
[TBL] [Abstract][Full Text] [Related]
4. Computing a Stable Distance on Merge Trees.
Bollen B; Tennakoon P; Levine JA
IEEE Trans Vis Comput Graph; 2023 Jan; 29(1):1168-1177. PubMed ID: 36197851
[TBL] [Abstract][Full Text] [Related]
5. Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances.
Yan L; Masood TB; Rasheed F; Hotz I; Wang B
IEEE Trans Vis Comput Graph; 2023 Aug; 29(8):3489-3506. PubMed ID: 35349444
[TBL] [Abstract][Full Text] [Related]
6. Interactive comparison of scalar fields based on largest contours with applications to flow visualization.
Schneider D; Wiebel A; Carr H; Hlawitschka M; Scheuermann G
IEEE Trans Vis Comput Graph; 2008; 14(6):1475-82. PubMed ID: 18988999
[TBL] [Abstract][Full Text] [Related]
7. Merge Tree Geodesics and Barycenters with Path Mappings.
Wetzels F; Pont M; Tierny J; Garth C
IEEE Trans Vis Comput Graph; 2024 Jan; 30(1):1095-1105. PubMed ID: 37878452
[TBL] [Abstract][Full Text] [Related]
8. Wasserstein Distances, Geodesics and Barycenters of Merge Trees.
Pont M; Vidal J; Delon J; Tierny J
IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):291-301. PubMed ID: 34596544
[TBL] [Abstract][Full Text] [Related]
9. Temporal Merge Tree Maps: A Topology-Based Static Visualization for Temporal Scalar Data.
Kopp W; Weinkauf T
IEEE Trans Vis Comput Graph; 2023 Jan; 29(1):1157-1167. PubMed ID: 36155442
[TBL] [Abstract][Full Text] [Related]
10. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
Horesh Y; Mehr R; Unger R
J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
[TBL] [Abstract][Full Text] [Related]
11. Symmetry in scalar field topology.
Thomas DM; Natarajan V
IEEE Trans Vis Comput Graph; 2011 Dec; 17(12):2035-44. PubMed ID: 22034321
[TBL] [Abstract][Full Text] [Related]
12. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
Fukagawa D; Tamura T; Takasu A; Tomita E; Akutsu T
BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S13. PubMed ID: 21342542
[TBL] [Abstract][Full Text] [Related]
13. MASTtreedist: visualization of tree space based on maximum agreement subtree.
Huang H; Li Y
J Comput Biol; 2013 Jan; 20(1):42-9. PubMed ID: 23294272
[TBL] [Abstract][Full Text] [Related]
14. Tree edit distance for leaf-labelled trees on free leafset and its comparison with frequent subsplit dissimilarity and popular distance measures.
Koperwas J; Walczak K
BMC Bioinformatics; 2011 May; 12():204. PubMed ID: 21612645
[TBL] [Abstract][Full Text] [Related]
15. ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs.
Lukasczyk J; Will M; Wetzels F; Weber GH; Garth C
IEEE Trans Vis Comput Graph; 2024 Jan; 30(1):1085-1094. PubMed ID: 37871087
[TBL] [Abstract][Full Text] [Related]
16. A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams.
Ramamurthi Y; Chattopadhyay A
IEEE Trans Vis Comput Graph; 2023 Sep; PP():. PubMed ID: 37703168
[TBL] [Abstract][Full Text] [Related]
17. Multiscale Symmetry Detection in Scalar Fields by Clustering Contours.
Thomas DM; Natarajan V
IEEE Trans Vis Comput Graph; 2014 Dec; 20(12):2427-36. PubMed ID: 26356956
[TBL] [Abstract][Full Text] [Related]
18. Toward Localized Topological Data Structures: Querying the Forest for the Tree.
Klacansky P; Gyulassy A; Bremer PT; Pascucci V
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):173-183. PubMed ID: 31403428
[TBL] [Abstract][Full Text] [Related]
19. A clique-based method using dynamic programming for computing edit distance between unordered trees.
Mori T; Tamura T; Fukagawa D; Takasu A; Tomita E; Akutsu T
J Comput Biol; 2012 Oct; 19(10):1089-104. PubMed ID: 23057820
[TBL] [Abstract][Full Text] [Related]
20. Toward a theory of statistical tree-shape analysis.
Feragen A; Lo P; de Bruijne M; Nielsen M; Lauze F
IEEE Trans Pattern Anal Mach Intell; 2013 Aug; 35(8):2008-21. PubMed ID: 23267202
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
