Balanced vertices in trees and a simpler algorithm to compute the genomic distance

Applied Mathematics Letters

Volumn 24, Issue 1, 2011, Pages 82-86

  Erdos, Péter L ^a   Soukup, Lajos ^a   Stoye, Jens ^b  

^a ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

Combinatorics on trees; Comparative genomics; Genome rearrangement

Indexed keywords

COMBINATORICS; COMPARATIVE GENOMICS; GENOME REARRANGEMENT; GENOMIC DISTANCE; LINEAR TIME; LINEAR-TIME ALGORITHMS; MULTICHROMOSOMAL GENOMES; SIMPLER ALGORITHMS; TRANSPARENT SOLUTIONS;

ALGORITHMS; GENES;

TREES (MATHEMATICS);

EID: 77957561566     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aml.2010.08.021     Document Type: Article

References (3)

1. S. Hannenhalli, and P.A. Pevzner Transforming men into mice (polynomial algorithm for genomic distance problem) Proc. 36th Annu. Symp. Found. Comput. Sci., FOCS 1995 1995 IEEE Press 581-592
2. A. Bergeron, J. Mixtacki, and J. Stoye A new linear time algorithm to compute the genomic distance via the double cut and join distance Theor. Comput. Sci. 410 2009 5300-5316
3. A. Gyrfs, and J. Lehel A Helly-type problem in trees P. Erds, A. Rnyi, V.T. Ss, Combinatorial Theory and its Applications II Colloquia Mathematica Scocietatis Jnos Blyai vol. 4 1970 North Holland 571 584 Balatonfred, 1969