메뉴 건너뛰기




Volumn , Issue , 2014, Pages 1296-1300

Quadratic-backtracking algorithm for string reconstruction from substring compositions

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

EID: 84906535793     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6875042     Document Type: Conference Paper
Times cited : (8)

References (18)
  • 5
  • 7
    • 0035255506 scopus 로고    scopus 로고
    • Efficient reconstruction of sequences from their subsequences or supersequences
    • V. I. Levenshtein, "Efficient reconstruction of sequences from their subsequences or supersequences, " Journal of Combinatorial Theory, Series A, vol. 93, no. 2, pp. 310-332, 2001.
    • (2001) Journal of Combinatorial Theory, Series a , vol.93 , Issue.2 , pp. 310-332
    • Levenshtein, V.I.1
  • 11
    • 79960724610 scopus 로고    scopus 로고
    • On prefix normal words
    • ser. Lecture Notes in Computer Science, G. Mauri and A. Leporati, Eds. Springer Berlin Heidelberg
    • G. Fici and Z. Liptk, "On prefix normal words, " in Developments in Language Theory, ser. Lecture Notes in Computer Science, G. Mauri and A. Leporati, Eds. Springer Berlin Heidelberg, 2011, vol. 6795, pp. 228-238.
    • (2011) Developments in Language Theory , vol.6795 , pp. 228-238
    • Fici, G.1    Liptk, Z.2
  • 12
    • 23844479398 scopus 로고    scopus 로고
    • Ph.D. dissertation, Simon Fraser University
    • T. Dakic, "On the turnpike problem, " Ph.D. dissertation, Simon Fraser University, 2000.
    • (2000) On the Turnpike Problem
    • Dakic, T.1
  • 13
    • 34250244723 scopus 로고
    • Factoring polynomials with rational coefficients
    • A. K. Lenstra, H. W. Lenstra, and L. Lovász, "Factoring polynomials with rational coefficients, " Math. Ann., vol. 261, pp. 515-534, 1982.
    • (1982) Math. Ann. , vol.261 , pp. 515-534
    • Lenstra, A.K.1    Lenstra, H.W.2    Lovász, L.3
  • 14
    • 0037376559 scopus 로고    scopus 로고
    • Factoring multivariate polynomials via partial differential equations
    • S. Gao, "Factoring multivariate polynomials via partial differential equations." Math. Comput., vol. 72, no. 242, pp. 801-822, 2003.
    • (2003) Math. Comput. , vol.72 , Issue.242 , pp. 801-822
    • Gao, S.1
  • 15
    • 0025258153 scopus 로고
    • On the deterministic complexity of factoring polynomials over finite fields
    • V. Shoup, "On the deterministic complexity of factoring polynomials over finite fields, " Inform. Process. Lett, vol. 33, pp. 261-267, 1990.
    • (1990) Inform. Process. Lett. , vol.33 , pp. 261-267
    • Shoup, V.1
  • 16
    • 0028505425 scopus 로고
    • An exponential example for a partial digest mapping algorithm
    • Z. Zhang, "An exponential example for a partial digest mapping algorithm." Journal of Computational Biology, vol. 1, no. 3, pp. 235- 239, 1994.
    • (1994) Journal of Computational Biology , vol.1 , Issue.3 , pp. 235-239
    • Zhang, Z.1


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