Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences.

BMC bioinformatics

Volumn 7 Suppl 5, Issue , 2006, Pages

  Forêt, Sylvain ^a   Kantorovitz, Miriam R ^a   Burden, Conrad J ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; BIOLOGY; COMPARATIVE STUDY; DNA SEQUENCE; EVALUATION; MATHEMATICAL COMPUTING; METHODOLOGY; SEQUENCE ALIGNMENT; SEQUENCE HOMOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; MATHEMATICAL COMPUTING; PATTERN RECOGNITION, AUTOMATED; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SEQUENCE HOMOLOGY;

MLCS; MLOWN;

EID: 34247563994     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-7-S5-S21     Document Type: Article

References (0)