메뉴 건너뛰기




Volumn 1264, Issue , 1997, Pages 83-89

An easy case of sorting by reversals

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

EID: 84948964916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_52     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 2
    • 0027873260 scopus 로고
    • Genome rearrangements and sorting by re-versals, in
    • V. BAFNA and P. PEVZNER, Genome rearrangements and sorting by re-versals, in Proc. 34th FOCS, IEEE, 1993, pp. 148-157.
    • (1993) Proc. 34Th FOCS, IEEE , pp. 148-157
    • Bafna, V.1    Pevzner, P.2
  • 4
    • 84948962430 scopus 로고
    • Maximal weighted matching on general graphs
    • Z. GALIL, S. MICALI, and H. GABOW, Maximal weighted matching on general graphs, in Proc. 23rd FOCS, IEEE, 1982, pp. 255-261.
    • (1982) Proc. 23Rd FOCS,IEEE , pp. 255-261
    • Galil, Z.1    Micali, S.2    Gabow, H.3
  • 5
    • 0001807019 scopus 로고
    • Transforming cabbage into turnip (Polynomial algorithm for sorting signed permutations by reversals
    • S. HANNENHALLI and P. PEVZNER, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), in Proc. 27th STOC, ACM, 1995, pp. 178-189.
    • (1995) Proc. 27Th STOC,ACM , pp. 178-189
    • Hannenhalli, S.1    Pevzner, P.2
  • 6
    • 84941152013 scopus 로고    scopus 로고
    • To cut…or not to cut (Applications of comparative physical maps in molecular evolution
    • S. HANNENHALLI and P. PEVZNER, To cut…or not to cut applications of comparative physical maps in molecular evolution, in Proc. 7th SODA, ACM-SIAM, 1996, pp. 304-313.
    • (1996) Proc. 7Th SODA, ACM-SIAM , pp. 304-313
    • Hannenhalli, S.1    Pevzner, P.2
  • 7
    • 0029185212 scopus 로고
    • Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
    • J. KECECIOGLU and D. SANKOFF, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algo-rithmica, 13 (1995), pp. 180-210.
    • (1995) Algo-Rithmica , vol.13 , pp. 180-210
    • Kececioglu, J.1    Sankoff, D.2
  • 8
    • 0030735997 scopus 로고    scopus 로고
    • Faster and simpler algorithm for sorting signed permutations by reversals, in
    • H. KAPLAN, R. SHAMIR, and R. TARJAN, Faster and simpler algorithm for sorting signed permutations by reversals, in Proc. 8th SODA, ACM, 1997, pp. 344-351.
    • (1997) Proc. 8Th SODA, ACM , pp. 344-351
    • Kaplan, H.1    Shamir, R.2    Tarjan, R.3
  • 9
    • 0024259002 scopus 로고
    • Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence
    • J. D. PALMER and L. A. HERBON, Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence, J. of Mol. Evol., 27 (1988), pp. 87-97.
    • (1988) J. Of Mol. Evol , vol.27 , pp. 87-97
    • Palmer, J.D.1    Herbon, L.A.2


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