메뉴 건너뛰기




Volumn 6, Issue 4, 2002, Pages 383-400

Center and distinguisher for strings with unbounded alphabet

Author keywords

Approximation algorithm; Center string selection; Computational molecular biology; Distinguishing string selection; Unbounded alphabet size

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GENETIC ENGINEERING; MOLECULAR BIOLOGY; POLYNOMIALS; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

EID: 0036887340     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019545003953     Document Type: Article
Times cited : (6)

References (17)
  • 11
    • 0025320805 scopus 로고
    • An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
    • (1990) Proteins , vol.7 , pp. 41-51
    • Lawrence, C.1    Reilly, A.2


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