Search results for "Longest common subsequences"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Peter Krusche, Alexander Tiskin	New algorithms for efficient parallel string comparison.	SPAA	2010	DBLP DOI BibTeX RDF	BSP algorithms, longest increasing subsequences, longest common subsequences
2	George S. Lueker	Improved bounds on the average length of longest common subsequences.	J. ACM	2009	DBLP DOI BibTeX RDF	Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences
2	Claus Rick	Efficient Computation of All Longest Common Subsequences.	SWAT	2000	DBLP DOI BibTeX RDF
2	Ricardo A. Baeza-Yates, Ricard Gavaldà, Gonzalo Navarro, Rodrigo Scheihing	Bounding the Expected Length of Longest Common Subsequences and Forests.	Theory Comput. Syst.	1999	DBLP DOI BibTeX RDF
2	Tao Jiang, Ming Li	On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.	ICALP	1994	DBLP DOI BibTeX RDF
1	Kang Ning, Hoong Kee Ng, Hon Wai Leong	Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences.	IJDMB	2011	DBLP DOI BibTeX RDF
1	Dang Quyet Thang	Algorithm to Determine Longest Common Subsequences of Two Finite Languages.	ACIIDS Posters	2011	DBLP DOI BibTeX RDF
1	Kang Ning, Hoong Kee Ng, Hon Wai Leong	Analysis of the Relationships among Longest Common Subsequences, Shortest Common Supersequences and Patterns and its application on Pattern Discovery in Biological Sequences	CoRR	2009	DBLP BibTeX RDF
1	Alexander Tiskin	Semi-local longest common subsequences in subquadratic time.	J. Discrete Algorithms	2008	DBLP DOI BibTeX RDF
1	Ruihong Huang, Le Sun, Yuanyong Feng	Study of Kernel-Based Methods for Chinese Relation Extraction.	AIRS	2008	DBLP DOI BibTeX RDF
1	Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu	RNA multiple structural alignment with longest common subsequences.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	RNA multiple structure alignment, Dynamic programming, Longest common subsequence
1	Bryant A. Julstrom, Brenda Hinkemeyer	Starting from Scratch: Growing Longest Common Subsequences with Evolution.	PPSN	2006	DBLP DOI BibTeX RDF	initially empty solutions, genetic algorithm, Longest common subsequence
1	Alexandre Tiskin	All Semi-local Longest Common Subsequences in Subquadratic Time.	CSR	2006	DBLP DOI BibTeX RDF
1	Alexandre Tiskin	Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs.	CPM	2006	DBLP DOI BibTeX RDF
1	Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan	Sieve: A Tool for Automatically Detecting Variations Across Program Versions.	ASE	2006	DBLP DOI BibTeX RDF
1	Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	A New Family of String Classifiers Based on Local Relatedness.	Discovery Science	2006	DBLP DOI BibTeX RDF
1	Christian Gruber, Thiemo Gruber, Bernhard Sick	Online Signature Verification with New Time Series Kernels for Support Vector Machines.	ICB	2006	DBLP DOI BibTeX RDF
1	Sergey Bereg, Binhai Zhu	RNA Multiple Structural Alignment with Longest Common Subsequences.	COCOON	2005	DBLP DOI BibTeX RDF
1	Alexandre Tiskin	Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences.	PARCO	2005	DBLP BibTeX RDF
1	Lei Chen 0002, M. Tamer Özsu, Vincent Oria	Robust and Fast Similarity Search for Moving Object Trajectories.	SIGMOD Conference	2005	DBLP DOI BibTeX RDF
1	Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro	Increased bit-parallelism for approximate and multiple string matching.	ACM Journal of Experimental Algorithmics	2005	DBLP DOI BibTeX RDF	multiple string matching, Approximate string matching, bit-parallelism
1	Ronald I. Greenberg	Bounds on the Number of Longest Common Subsequences	CoRR	2003	DBLP BibTeX RDF
1	Ronald I. Greenberg	Computing the Number of Longest Common Subsequences	CoRR	2003	DBLP BibTeX RDF
1	George S. Lueker	Improved bounds on the average length of longest common subsequences.	SODA	2003	DBLP DOI BibTeX RDF
1	Ronald I. Greenberg	Fast and Simple Computation of All Longest Common Subsequences	CoRR	2002	DBLP BibTeX RDF
1	Claus Rick	Simple and fast linear space computation of longest common subsequences.	Inf. Process. Lett.	2000	DBLP DOI BibTeX RDF
1	Guillaume Luce, Jean Frédéric Myoupo	Systolic-based parallel architecture for the longest common subsequences problem.	Integration	1998	DBLP DOI BibTeX RDF
1	Lasse Bergroth, Harri Hakonen, Timo Raita	New Approximation Algorithms for Longest Common Subsequences.	SPIRE	1998	DBLP BibTeX RDF
1	Tao Jiang, Ming Li	On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.	SIAM J. Comput.	1995	DBLP DOI BibTeX RDF
1	Francis Y. L. Chin, Chung Keung Poon	Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences.	Algorithmica	1994	DBLP DOI BibTeX RDF
1	Mike Paterson, Vlado Dancík	Longest Common Subsequences.	MFCS	1994	DBLP DOI BibTeX RDF
1	Alberto Apostolico, S. Browne, Concettina Guerra	Fast Linear-Space Computations of Longest Common Subsequences.	Theor. Comput. Sci.	1992	DBLP DOI BibTeX RDF
1	Walter F. Tichy	The String-to-String Correction Problem with Block Moves	ACM Trans. Comput. Syst.	1984	DBLP DOI BibTeX RDF	block moves, revision control, source control, string deltas, pattern matching, longest common subsequences, string edits