<--- Back to Details
First PageDocument Content
Dynamic programming / Formal languages / Arrays / Suffix array / Suffix tree / Longest common substring problem / Linguistic morphology / Substring / Longest repeated substring problem / String / Mathematics / Computing
Date: 2013-08-24 07:18:22
Dynamic programming
Formal languages
Arrays
Suffix array
Suffix tree
Longest common substring problem
Linguistic morphology
Substring
Longest repeated substring problem
String
Mathematics
Computing

Add to Reading List

Source URL: media.wiley.com

Download Document from Source Website

File Size: 241,10 KB

Share Document on Facebook

Similar Documents

Mathematics / Dynamic programming / Combinatorics / Formal languages / Discrete mathematics / Longest common subsequence problem / Subsequence / Substring

1 Exemplar Longest Common Subsequence Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin , Raffaella Rizzi and St´ephane Vialette

DocID: 1qY8g - View Document

Time-Space Trade-Offs for the Longest Common Substring Problem Tatiana Starikovskaya1 and Hjalte Wedel Vildhøj2 1 Moscow State University, Department of Mechanics and Mathematics,

DocID: 1kc2v - View Document

Control theory / Longest common subsequence problem / Algorithm / Substring / Longest common substring problem / Fibonacci number / Overlapping subproblems / Longest increasing subsequence / Dynamic programming / Mathematics / Applied mathematics

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003

DocID: 1ayWj - View Document

Computing / Suffix tree / Rope / Substring / Knuth–Morris–Pratt algorithm / String kernel / Longest common substring problem / Approximate string matching / String / Binary trees / Mathematics

1 Fast Kernels for String and Tree Matching S.V.N. Vishwanathan Machine Learning Program

DocID: 18soE - View Document

Suffix array / Substring / Dynamic programming / Computing / Computer programming / Rope / Longest common substring problem / String / Binary trees / Arrays

Computing minimal and maximal suffixes of a substring revisited Maxim Babenko1 Pawel Gawrychowski2 Tomasz Kociumaka3 Tatiana Starikovskaya1 National Research University Higher School of Economics (HSE) Max-Planck-Institu

DocID: 15Hz3 - View Document