메뉴 건너뛰기




Volumn 684 LNCS, Issue , 1993, Pages 87-105

Exact and approximation algorithms for the inversion distance between two chromosomes

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; CHROMOSOMES; CLUSTERING ALGORITHMS; FUZZY LOGIC; FUZZY SETS; LINEAR PROGRAMMING; PATTERN MATCHING; TREES (MATHEMATICS);

EID: 84976632165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029799     Document Type: Conference Paper
Times cited : (78)

References (21)
  • 1
    • 38249034650 scopus 로고
    • Sorting by insertion of leading elements
    • Series A
    • Aigner, Martin and Douglas B. West. Sorting by insertion of leading elements. Journal of Combinatorial Theory (Series A) 45, 306-309, 1987.
    • (1987) Journal of Combinatorial Theory , vol.45 , pp. 306-309
    • Aigner, M.1    West, D.B.2
  • 2
    • 38249006967 scopus 로고
    • Reversing trains: A turn of the century sorting problem
    • Amato, Nancy, Manuel Blum, Sandra Irani, and Ronitt Rubinfeld. Reversing trains: a turn of the century sorting problem. Journal of Algorithms 10, 413-428, 1989.
    • (1989) Journal of Algorithms , vol.10 , pp. 413-428
    • Amato, N.1    Blum, M.2    Irani, S.3    Rubinfeld, R.4
  • 5
    • 0013326025 scopus 로고
    • The minimum-length generator sequence problem is NP-hard
    • Even, S. and O. Goldreich. The minimum-length generator sequence problem is NP-hard. Journal of Algorithms 2, 311-313, 1981.
    • (1981) Journal of Algorithms , vol.2 , pp. 311-313
    • Even, S.1    Goldreich, O.2
  • 7
  • 9
    • 0022050244 scopus 로고
    • The complexity of finding minimum-length generator sequences
    • Jerrum, Mark R. The complexity of finding minimum-length generator sequences. Theoretical Computer Science 36, 265-289, 1985.
    • (1985) Theoretical Computer Science , vol.36 , pp. 265-289
    • Jerrum, M.R.1
  • 10
    • 85029527006 scopus 로고    scopus 로고
    • Exact and approximation algorithms for the inversion distance between two chromosomes
    • Kececioglu, John and David Sankoff. Exact and approximation algorithms for the inversion distance between two chromosomes. To appear in Algorithmica.
    • To appear in Algorithmica.
    • Kececioglu, J.1    Sankoff, D.2
  • 13
    • 0004235353 scopus 로고
    • Gold Spring Harbor Laboratory
    • O’Brien, S.J., editor. Genetic Maps. Gold Spring Harbor Laboratory, 1987.
    • (1987) Genetic Maps.
    • O’Brien, S.J.1
  • 14
    • 0002468106 scopus 로고
    • Evolutionary significance of inversions in legume chloroplast DNAs
    • Palmer, J.D., B. Osorio, and W.F. Thompson. Evolutionary significance of inversions in legume chloroplast DNAs. Current Genetics 14, 65-74, 1988.
    • (1988) Current Genetics , vol.14 , pp. 65-74
    • Palmer, J.D.1    Osorio, B.2    Thompson, W.F.3
  • 16
    • 0026891610 scopus 로고
    • A local algorithm for DNA sequence alignment with inversions
    • Schöniger, Michael and Michael S. Waterman. A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54, 521-536, 1992.
    • (1992) Bulletin of Mathematical Biology , vol.54 , pp. 521-536
    • Schöniger, M.1    Waterman, M.S.2
  • 17
    • 0002680629 scopus 로고
    • Chromosomes: Molecular cytogenetics
    • David M. Hillis and Craig Moritz editors, Sinauer, Sunderland, Massachusetts
    • Sessions, Stanley K. Chromosomes: molecular cytogenetics. In Molecular Systematics, David M. Hillis and Craig Moritz editors, Sinauer, Sunderland, Massachusetts, 156-204, 1990.
    • (1990) Molecular Systematics , pp. 156-204
    • Sessions, S.K.1
  • 18
    • 84976728067 scopus 로고
    • The string-to-string correction problem with block moves
    • Tichy, Walter F. The string-to-string correction problem with block moves. ACM Transactious on Computer Systems 2:4, 309-321, 1984.
    • (1984) ACM Transactious on Computer Systems , vol.2 , Issue.4 , pp. 309-321
    • Tichy, W.F.1
  • 19
    • 0007430498 scopus 로고
    • On the complexity of the extended string-to-string correction problem
    • David Sankoff and Joseph B. Kruskal, editors, Addison-Wesley, Reading Massachusetts
    • Wagner, Robert A. On the complexity of the extended string-to-string correction problem. In Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, David Sankoff and Joseph B. Kruskal, editors, Addison-Wesley, Reading Massachusetts, 215-235, 1983.
    • (1983) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , pp. 215-235
    • Wagner, R.A.1


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