|
Volumn 13, Issue 1-2, 1995, Pages 180-210
|
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
|
Author keywords
Approximation algorithms; Branch and bound algorithms; Chromosome inversions; Computational biology; Edit distance; Experimental analysis of algorithms; Genome rearrangements; Permutations; Sorting by reversals
|
Indexed keywords
APPROXIMATION THEORY;
BIOLOGY;
CHROMOSOMES;
LINEAR PROGRAMMING;
MATHEMATICAL MODELS;
NATURAL SCIENCES COMPUTING;
RANDOM PROCESSES;
STATISTICAL METHODS;
BRANCH AND BOUND ALGORITHMS;
EXPERIMENTAL ALGORITHM ANALYSIS;
GREEDY APPROXIMATION ALGORITHMS;
MITOCHONDRIAL GENOMES;
PERMUTATIONS;
ALGORITHMS;
|
EID: 0029185212
PISSN: 01784617
EISSN: 14320541
Source Type: Journal
DOI: 10.1007/BF01188586 Document Type: Article |
Times cited : (212)
|
References (28)
|