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

Longest common subsequence problem
Results: 34

#	Item
1	Noisy FAQ Retrieval Using Longest Common Subsequence Problem Pooja Porwal Aman Jain Add to Reading List Source URL: www.isical.ac.in - Date: 2013-11-30 07:10:01
2	Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1 3 Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2008-03-23 11:43:26 Computational complexity theory Mathematics Dynamic programming Theory of computation IP Longest common subsequence problem
3	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
4	An Algorithm for Differential File Comparison J. W. Hunt Department of Electrical Engineering, Stanford University, Stanford, California M. D. McIlroy Bell Laboratories, Murray Hill, New Jersey 07974 Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2013-02-15 00:09:52 Mathematics Dynamic programming Combinatorics Discrete mathematics Formal languages Data differencing HuntMcIlroy algorithm Longest increasing subsequence Longest common subsequence problem Subsequence Diff utility Data comparison
5	A = a x aa m if and only if there is a mapping F: {1, 2, . . . , p} ~ {1, 2, . . . , m} such that f(i) = k only if c~ is ak and F is a m o n o t o n e strictly increasing function (i.e. F(i) = u, F ( j ) = v, a Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Dynamic programming Combinatorics Subsequence Longest common subsequence problem Longest increasing subsequence HuntMcIlroy algorithm
6	SpADe: On Shape-based Pattern Detection in Streaming Time Series Yueguo Chen§ Mario A. Nascimento†∗ § Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2006-11-21 02:44:25 Dynamic programming Elementary mathematics Dynamic time warping Time series analysis Combinatorics Search algorithms Sequence Subsequence Longest common subsequence problem K-nearest neighbors algorithm Pattern matching Euclidean distance
7	Multiple Sequence Alignment and Phylogenetic Reconstruction: Theory and Methods in Biological Data Analysis Gianluca Della Vedova Add to Reading List Source URL: www.statistica.unimib.it Language: English - Date: 2004-04-21 05:50:41 Bioinformatics Computational phylogenetics Phylogenetics Combinatorics Dynamic programming Sequence alignment Multiple sequence alignment Phylo Homology Shortest common supersequence problem Longest common subsequence problem Alignment-free sequence analysis
8	A variational theory of hyperbolic Lagrangian Coherent Structures Add to Reading List Source URL: georgehaller.com Language: English - Date: 2015-06-08 10:21:03 Chaos theory Lagrangian coherent structure Turbulence Mathematics Combinatorics Physics Longest common subsequence problem Mechanics
9	Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping Karl Bringmann∗ Marvin Künnemann† Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:08 Dynamic programming Dynamic time warping Longest common subsequence problem Levenshtein distance Metric space Exponential time hypothesis NC
10	Achieving TeraCUPS on Longest Common Subsequence Problem using GPGPUs Add to Reading List Source URL: www.cs.otago.ac.nz Language: English - Date: 2014-02-23 23:53:05

UPDATE