메뉴 건너뛰기




Volumn 2676, Issue , 2003, Pages 315-327

Complexities of the centre and median string problems

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; PATTERN MATCHING; SPEECH RECOGNITION;

EID: 21144439407     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_23     Document Type: Article
Times cited : (36)

References (24)
  • 2
    • 84869200923 scopus 로고    scopus 로고
    • A ptas for distinguishing (sub)string selection
    • X. Deng, G. Li, Z. Li, B. Ma, and L. Wang. A ptas for distinguishing (sub)string selection. In ICALP, pages 740-751, 2002.
    • (2002) ICALP , pp. 740-751
    • Deng, X.1    Li, G.2    Li, Z.3    Ma, B.4    Wang, L.5
  • 5
    • 70350646559 scopus 로고    scopus 로고
    • Exact solutions for CLOSEST STRING and related problems
    • ISAAC
    • Jens Gramm, Rolf Niedermeier, and Peter Rossmanith. Exact solutions for CLOSEST STRING and related problems. In ISAAC, volume 2223 of LCNS, pages 441-453, 2001.
    • (2001) LCNS , vol.2223 , pp. 441-453
    • Gramm, J.1    Niedermeier, R.2    Rossmanith, P.3
  • 6
    • 0027351056 scopus 로고
    • Efficient methods for multiple sequence alignment with guaranteed error bounds
    • Dan Gusfield. Efficient methods for multiple sequence alignment with guaranteed error bounds. Bull. Math. Biol., 55:141-154, 1993.
    • (1993) Bull. Math. Biol. , vol.55 , pp. 141-154
    • Gusfield, D.1
  • 8
    • 0000880429 scopus 로고    scopus 로고
    • Approximation algorithms for tree alignment with a given phylogeny
    • Tao Jiang, Eugene L. Lawler, and Lusheng Wang. Approximation algorithms for tree alignment with a given phylogeny. Algorithmica, 16(3):302-315, 1996.
    • (1996) Algorithmica , vol.16 , Issue.3 , pp. 302-315
    • Jiang, T.1    Lawler, E.L.2    Wang, L.3
  • 11
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions and Reverseals
    • V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and Reverseals. Cybernetics and Control Theory, 10(8):707-710, 1966.
    • (1966) Cybernetics and Control Theory , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 12
    • 0141653290 scopus 로고    scopus 로고
    • On the closest string and substing problems
    • M. Li, B. Ma, and L. Wang. On the closest string and substing problems. Journal of the ACM, 49(2):157-171, 2002.
    • (2002) Journal of the ACM , vol.49 , Issue.2 , pp. 157-171
    • Li, M.1    Ma, B.2    Wang, L.3
  • 14
    • 84937390208 scopus 로고    scopus 로고
    • A polynomial time approximation scheme for the closest substring problem
    • CPM
    • Bin Ma. A polynomial time approximation scheme for the closest substring problem. In CPM, volume 1848 of LNCS, pages 99-107, 2000.
    • (2000) LNCS , vol.1848 , pp. 99-107
    • Ma, B.1
  • 15
    • 84976657294 scopus 로고
    • The complexity of some problems on subsequences and supersequences
    • D. Maier. The complexity of some problems on subsequences and supersequences. Journal of the Association for Computing Machinery, 25:322-336, 1978.
    • (1978) Journal of the Association for Computing Machinery , vol.25 , pp. 322-336
    • Maier, D.1
  • 16
    • 0033677426 scopus 로고    scopus 로고
    • Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification
    • L. Marsan and M. F. Sagot. Algorithms for extracting structured motifs using a suffix tree with an application to promoter and regulatory site consensus identification. J Comput Biol, 7(3-4):345-62, 2000.
    • (2000) J Comput Biol , vol.7 , Issue.3-4 , pp. 345-362
    • Marsan, L.1    Sagot, M.F.2
  • 20
    • 0346991447 scopus 로고    scopus 로고
    • On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
    • to appear
    • Krzysztof Pietrzak. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences, 2003. to appear.
    • (2003) Journal of Computer and System Sciences
    • Pietrzak, K.1
  • 21
    • 33846251363 scopus 로고    scopus 로고
    • The consensus string problem for a metric is NP-complete
    • R. Raman and J. Simpson, editors, Perth, WA, Australia
    • J. S. Sim and K. Park. The consensus string problem for a metric is NP-complete. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, pages 107-113, Perth, WA, Australia, 1999.
    • (1999) Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms , pp. 107-113
    • Sim, J.S.1    Park, K.2
  • 23
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • Robert A. Wagner and Michael J. Fischer. The string-to-string correction problem. Journal of the ACM (JACM), 21(1):168-173, 1974.
    • (1974) Journal of the ACM (JACM) , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 24
    • 0000503180 scopus 로고    scopus 로고
    • Improved approximation algorithms for tree alignment
    • L. Wang and D. Gusfield. Improved approximation algorithms for tree alignment. J. Algorithms, 25(2):255-273, 1997.
    • (1997) J. Algorithms , vol.25 , Issue.2 , pp. 255-273
    • Wang, L.1    Gusfield, D.2


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