<--- Back to Details
First PageDocument Content
Theory of computation / Dynamic programming / Maximal pair / String / Mathematics / String searching algorithm / Suffix tree / Approximate string matching / Time complexity / Algorithm / Computer science
Date: 2008-10-22 02:35:21
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

Add to Reading List

Source URL: pbil.univ-lyon1.fr

Download Document from Source Website

File Size: 510,66 KB

Share Document on Facebook

Similar Documents

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

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

doi:j.ins

doi:j.ins

DocID: 1r4I2 - View Document

CSE 584 Algorithms for Biosequence Comparison  Spring Semester 2016 Homework 2 Assigned:

CSE 584 Algorithms for Biosequence Comparison Spring Semester 2016 Homework 2 Assigned:

DocID: 1r1lX - View Document

CSE 181 Project guidelines

CSE 181 Project guidelines

DocID: 1qDcO - View Document

CSE 584A Class 15 Jeremy Buhler March 21, 2016 1

CSE 584A Class 15 Jeremy Buhler March 21, 2016 1

DocID: 1qArj - View Document