Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance

Péter L. Erdős and Lajos Soukup and Jens Stoye
Arxiv ID: 1004.2735Last updated: 1/1/2021
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 et al. to compute the rearrangement distance between two multichromosomal genomes in linear time (Theor. Comput. Sci., 410:5300-5316, 2009). In the process it introduces a new center notion for trees, which seems to be interesting on its own.

PaperStudio AI Chat

I'm your research assistant! Ask me anything about this paper.

Related papers

Commercial Disclosure
© 2023 Paper Studio™. All Rights Reserved.