Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance
Discrete Mathematics
2021-01-01 v1 Combinatorics
Abstract
This paper provides a short and transparent solution for the covering cost of white-grey trees which play a crucial role in the algorithm of Bergeron {\it et al.}\ to compute the rearrangement distance between two multichromosomal genomes in linear time ({\it Theor. Comput. Sci.}, 410:5300-5316, 2009). In the process it introduces a new {\em center} notion for trees, which seems to be interesting on its own.
Keywords
Cite
@article{arxiv.1004.2735,
title = {Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance},
author = {Péter L. Erdős and Lajos Soukup and Jens Stoye},
journal= {arXiv preprint arXiv:1004.2735},
year = {2021}
}
Comments
6 pages, submitted