Branch Decomposition‐Independent Edit Distances for Merge Trees
AbstractEdit distances between merge trees of scalar fields have many applications in scientific visualization, such as ensemble analysis, feature tracking or symmetry detection. In this paper, we propose branch mappings, a novel approach to the construction of edit mappings for merge trees.
Florian Wetzels +2 more
openaire +4 more sources
An Optimal Decomposition Algorithm for Tree Edit Distance [PDF]
The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this article, we present a worst-case O
Erik D. Demaine +3 more
openaire +1 more source
Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems
Dynamic programming is a classical algorithmic paradigm, which often allows the evaluation of a search space of exponential size in polynomial time. Recursive problem decomposition, tabulation of intermediate results for re-use, and Bellman’s Principle ...
Robert Giegerich, H´el'ene Touzet
doaj +1 more source
Phylogenetic identification of lateral genetic transfer events
Background Lateral genetic transfer can lead to disagreements among phylogenetic trees comprising sequences from the same set of taxa. Where topological discordance is thought to have arisen through genetic transfer events, tree comparisons can be used ...
Hamilton Nicholas, Beiko Robert G
doaj +1 more source
A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression
We introduce a new dissimilarity measure between a pair of “clonal trees”, each representing the progression and mutational heterogeneity of a tumor sample, constructed by the use of single cell or bulk high throughput sequencing data.
Nikolai Karpov +3 more
doaj +1 more source
Publishing Anonymized Set-Valued Data via Disassociation towards Analysis
Data publishing is a challenging task for privacy preservation constraints. To ensure privacy, many anonymization techniques have been proposed. They differ in terms of the mathematical properties they verify and in terms of the functional objectives ...
Nancy Awad +3 more
doaj +1 more source
TRAVeLer: a tool for template-based RNA secondary structure visualization
Background Visualization of RNA secondary structures is a complex task, and, especially in the case of large RNA structures where the expected layout is largely habitual, the existing visualization tools often fail to produce suitable visualizations ...
Richard Elias, David Hoksza
doaj +1 more source
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source
Process‐Informed Analysis of As‐Built Metal Additive Surface Features
This article introduces a novel method for feature‐based surface texture characterisation directly incorporating manufacturing variables into the feature extraction workflow. This marks a major step towards identifying process‐specific surface properties and their influence on part function and hence a holistic understanding of process–structure ...
Theresa Buchenau +5 more
wiley +1 more source
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reconstruction.
Apostolico Alberto, Denas Olgert
doaj +1 more source

