메뉴 건너뛰기




Volumn , Issue , 2002, Pages 67-76

Comparison of minisatellites

Author keywords

Alignment; Bioinformatics; Dynamic programming; Evolution; Minisatellite; Overlap graphs; Sequence comparison; Tandem repeats

Indexed keywords

CHROMOSOMES; COMBINATORIAL MATHEMATICS; COMPUTER SOFTWARE; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; PATTERN RECOGNITION;

EID: 0036377374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/565196.565205     Document Type: Conference Paper
Times cited : (7)

References (15)
  • 4
    • 0033555906 scopus 로고    scopus 로고
    • Tandem repeats finder: A program to analyze DNA sequences
    • Jan
    • (1999) Nucleic Acids Res , vol.27 , Issue.2 , pp. 573-580
    • Benson, G.1
  • 8
    • 0030807655 scopus 로고    scopus 로고
    • BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data
    • Jul
    • (1997) Mol Biol Evol , vol.14 , Issue.7 , pp. 685-695
    • Gascuel, O.1
  • 12
    • 0010403668 scopus 로고    scopus 로고
    • Extension of the max stable set problem for overlap graphs
    • Technical Report 01-183, LIRMM
    • (2001)
    • Rivals, E.1
  • 13
    • 0003725141 scopus 로고    scopus 로고
    • Time warps, string edits and macromolecules: The theory and practice of sequence comparison
    • D. Sankoff and J. B. Kruskal, editors; CSLI Publications, second edition
    • (1999)


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