메뉴 건너뛰기




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;

EID: 0029185212     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01188586     Document Type: Article
Times cited : (212)

References (28)
  • 3
    • 84936722197 scopus 로고    scopus 로고
    • Bafna, V., and P. A. Pevzner. Genome rearrangements and sorting by reversals. Proceedings of the 34th Symposium on Foundations of Computer Science, November 1993, pp. 148–157.
  • 8
    • 84936722243 scopus 로고    scopus 로고
    • Furst, M., J. Hopcroft, and E. Luks. Polynomial-time algorithms for permutation groups. Proceedings of the 21st Symposium on Foundations of Computer Science, 1980, pp. 36–41.
  • 11
    • 84936722242 scopus 로고    scopus 로고
    • Golan, H. Personal communication, 1991.
  • 18
    • 84936722241 scopus 로고    scopus 로고
    • Micali, S. and V. Vazirani. An o(√¦V¦·¦E¦) algorithm for finding maximum matchings in general graphs. Proceedings of the 21st Symposium on Foundations of Computer Science, 1980, pp. 17–27.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.