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, - Longest common substring problem - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2013-07-10 03:07:54 Open Document File Size: 1,23 MB Share Result on Facebook Company Time-Space Trade / / Country Germany / / Currency AUD / USD / TWD / / / Facility Technical University of Denmark / Moscow State University / / Organization Moscow State University / Department of Mechanics and Mathematics / Technical University of Denmark / / SocialTag Applied mathematics Combinatorics Longest common subsequence problem Substring Longest common substring problem Suffix tree Dynamic programming Mathematics Theoretical computer science

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