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

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

2010-04-15

arxiv.org/abs/1004.2735v1

Computer Science

Discrete Mathematics

6 pages, submitted

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Balanced Vertices in Trees and a Simpler Algorithm to Compute the Genomic Distance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-622830