Subsequence

Results: 100



#Item
51Subsequence Combinatorics and Applications Sven Rahmann Algorithms and Statistics for Systems Biology Group Genome Informatics, Department of Technology, Bielefeld University, Germany  CPM’06, Barcelona,

Subsequence Combinatorics and Applications Sven Rahmann Algorithms and Statistics for Systems Biology Group Genome Informatics, Department of Technology, Bielefeld University, Germany CPM’06, Barcelona,

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2006-07-05 09:33:34
52CS 373  Homework 1 (dueSpring 1999

CS 373 Homework 1 (dueSpring 1999

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:54:08
5316th Canadian Conference on Computational Geometry, 2004  ´ any’s ´ A Stronger Version of Bar Theorem in the Plane

16th Canadian Conference on Computational Geometry, 2004 ´ any’s ´ A Stronger Version of Bar Theorem in the Plane

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
54Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical

Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2013-04-23 13:36:27
55Window Subsequence Problems for Compressed Texts Patrick C´egielski1 , Ir`ene Guessarian2 , Yury Lifshits3 and Yuri Matiyasevich3 1 Universit´ e

Window Subsequence Problems for Compressed Texts Patrick C´egielski1 , Ir`ene Guessarian2 , Yury Lifshits3 and Yuri Matiyasevich3 1 Universit´ e

Add to Reading List

Source URL: yury.name

Language: English - Date: 2006-06-11 02:48:50
56Window subsequence problems for compressed texts? Patrick C´egielski1, Ir`ene Guessarian2 , Yury Lifshits3 , Yuri Matiyasevich3 1  LACL, UMR-FRE 2673, Universit´e Paris 12, Route foresti`ere Hurtault, F-77300

Window subsequence problems for compressed texts? Patrick C´egielski1, Ir`ene Guessarian2 , Yury Lifshits3 , Yuri Matiyasevich3 1 LACL, UMR-FRE 2673, Universit´e Paris 12, Route foresti`ere Hurtault, F-77300

Add to Reading List

Source URL: yury.name

Language: English - Date: 2008-11-06 21:42:34
57Homework Nine, for Fri[removed]CSE[removed]Problem 6.1. For this problem, use the following subproblem definition: for each 1 ≤ j ≤ n, S(j) = maximum sum of any contiguous subsequence ending exactly at position j.

Homework Nine, for Fri[removed]CSE[removed]Problem 6.1. For this problem, use the following subproblem definition: for each 1 ≤ j ≤ n, S(j) = maximum sum of any contiguous subsequence ending exactly at position j.

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2014-12-06 13:32:37
584.2 The Erd˝ os–Szekeres theorem 39  We will be interested in the length of the longest increasing and decreasing

4.2 The Erd˝ os–Szekeres theorem 39 We will be interested in the length of the longest increasing and decreasing

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2007-08-30 03:42:28
59Solutions to Homework Nine  CSE[removed]Subproblem: Let S(j) be the sum of the maximum-sum contiguous subsequence which ends exactly at aj (but is possibly of length zero). We want maxj S(j).

Solutions to Homework Nine CSE[removed]Subproblem: Let S(j) be the sum of the maximum-sum contiguous subsequence which ends exactly at aj (but is possibly of length zero). We want maxj S(j).

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2014-12-10 12:27:22
60Subsequence Matching (Embedding) Querying and Embedding Compressed Texts INPUT: pattern TEAM and text I N T E R N A T I ON A L S YMP O S I UM

Subsequence Matching (Embedding) Querying and Embedding Compressed Texts INPUT: pattern TEAM and text I N T E R N A T I ON A L S YMP O S I UM

Add to Reading List

Source URL: yury.name

Language: English - Date: 2006-08-27 15:04:00