<--- Back to Details
First PageDocument Content
Applied mathematics / Dynamic programming / FASTA / Sequence alignment / BLAST / Smith–Waterman algorithm / Multiple sequence alignment / Needleman–Wunsch algorithm / Approximate string matching / Science / Computational phylogenetics / Bioinformatics
Date: 2006-09-30 03:01:48
Applied mathematics
Dynamic programming
FASTA
Sequence alignment
BLAST
Smith–Waterman algorithm
Multiple sequence alignment
Needleman–Wunsch algorithm
Approximate string matching
Science
Computational phylogenetics
Bioinformatics

Microsoft Word[removed]doc

Add to Reading List

Source URL: www.wseas.us

Download Document from Source Website

File Size: 1,34 MB

Share Document on Facebook

Similar Documents

String computer science) / Linguistics / Formal languages / Computing / Dynamic programming / Approximate string matching / Pattern matching / Suffix tree / JaroWinkler distance / String metric / String / Comparison of programming languages

Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical Sci

DocID: 1rk7H - View Document

Dynamic programming / Maximal pair / String / String searching algorithm / Approximate string matching / Suffix tree / Mathematics / Computing / Computer programming / LCP array

A PATTERN EXTRACTION ALGORITHM FOR ABSTRACT MELODIC REPRESENTATIONS THAT ALLOW PARTIAL OVERLAPPING OF INTERVALLIC CATEGORIES Emilios Cambouropoulos1 , Maxime Crochemore2,3 , Costas Iliopoulos3 , Manal Mohamed3 , Marie-Fr

DocID: 1rgdB - View Document

Theory of computation / Dynamic programming / Maximal pair / String / Mathematics / String searching algorithm / Suffix tree / Approximate string matching / Time complexity / Algorithm / Computer science

doi:j.ins

DocID: 1r4I2 - View Document

Finite automata / Trie / Software engineering / Computer programming / Computing / Tree / Distributed data storage / String matching algorithms / Radix tree

Indexing Mixed Types for Approximate Retrieval Liang Jin Nick Koudas University of California, Irvine, USA

DocID: 1q5EM - View Document

Computing / String computer science) / Computer programming / Arrays / LCP array / Suffix array / String searching algorithm / Binary search algorithm / Approximate string matching / FM-index / Trie / Array data type

Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various Problems

DocID: 1pYuy - View Document