메뉴 건너뛰기





Volumn 74, Issue 5, 2008, Pages 831-849

Hardness of optimal spaced seed design

Author keywords

Alignment; Approximability; Filtration; Gapped seed; Golomb ruler; Maximum coverage; Maximum independent set; Sequence comparison; Spaced seed; String matching; Tiling

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; NUMBER THEORY;

EID: 43649102474     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2007.10.001     Document Type: Article
Times cited : (18)

References (30)
  • Reference 정보가 존재하지 않습니다.

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