Longest common substring problem - PDFSEARCH.IO - Document Search Engine

Longest common substring problem
Results: 22

#	Item
1	1 Exemplar Longest Common Subsequence Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin , Raffaella Rizzi and St´ephane Vialette Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:04 Mathematics Dynamic programming Combinatorics Formal languages Discrete mathematics Longest common subsequence problem Subsequence Substring
2	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, Add to Reading List Source URL: www.hwv.dk Language: English
3	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:42 Control theory Longest common subsequence problem Algorithm Substring Longest common substring problem Fibonacci number Overlapping subproblems Longest increasing subsequence Dynamic programming Mathematics Applied mathematics
4	1 Fast Kernels for String and Tree Matching S.V.N. Vishwanathan Machine Learning Program Add to Reading List Source URL: www.stat.purdue.edu Language: English - Date: 2008-09-11 13:00:17 Computing Suffix tree Rope Substring Knuth–Morris–Pratt algorithm String kernel Longest common substring problem Approximate string matching String Binary trees Mathematics
5	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 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-18 11:22:46 Suffix array Substring Dynamic programming Computing Computer programming Rope Longest common substring problem String Binary trees Arrays
6	Motivation Dynamic FCST’s Conclusions Dynamic Fully-Compressed Suffix Trees Lu´ıs M. S. Russo Gonzalo Navarro Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2008-06-12 22:00:30 Suffix tree Searching Longest common substring problem String Search engine indexing Information science Information retrieval Combinatorics
7	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, Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2013-07-10 03:07:54 Applied mathematics Combinatorics Longest common subsequence problem Substring Longest common substring problem Suffix tree Dynamic programming Mathematics Theoretical computer science
8	Traitor-Tracing on Binary Strings Michael J. Collins Sandia National Laboratories⋆ Albuquerque, NM USA 87185 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-23 13:49:52 Formal languages Mathematics Longest common substring problem Substring Linguistics Orbifold Comparison of programming languages Combinatorics String Dynamic programming
9	Semi-local string comparison Alexander Tiskin http://www.dcs.warwick.ac.uk/~tiskin Department of Computer Science University of Warwick Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2006-07-07 01:33:40 String Combinatorics NP-complete problems Formal languages Substring Longest common subsequence problem Subsequence Approximate string matching String searching algorithm Mathematics Dynamic programming Theoretical computer science
10	Exact pattern matching Advanced Algorithms – COMS31900 Input A text string T (length n) and a pattern string P (length m Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:19 Computer programming Binary trees Generalised suffix tree B-tree Longest common substring problem Suffix tree Computing Data management