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

Erdős PL, Soukup L, Stoye J (2010) .

Report | Published | English

No fulltext has been uploaded

Author
; ;
Abstract
This paper provides a short and transparent solution for the covering cost ofwhite-grey trees which play a crucial role in the algorithm of Bergeron {\it etal.}\ to compute the rearrangement distance between two multichromosomalgenomes in linear time ({\it Theor. Comput. Sci.}, 410:5300-5316, 2009). In theprocess it introduces a new {\em center} notion for trees, which seems to beinteresting on its own.
Publishing Year
PUB-ID

Cite this

Erdős PL, Soukup L, Stoye J. Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance.; 2010.
Erdős, P. L., Soukup, L., & Stoye, J. (2010). Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance.
Erdős, P. L., Soukup, L., and Stoye, J. (2010). Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance.
Erdős, P.L., Soukup, L., & Stoye, J., 2010. Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance,
P.L. Erdős, L. Soukup, and J. Stoye, Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance, 2010.
Erdős, P.L., Soukup, L., Stoye, J.: Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. (2010).
Erdős, Péter L., Soukup, Lajos, and Stoye, Jens. Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance. 2010.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Sources

arXiv 1004.2735

Search this title in

Google Scholar