Subsequence

Results: 100



#Item
1Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2, ..., n2 whose longest monotone subsequence is of length n and are therefore extremal for the Erd˝ os-Szekeres theorem. S

Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2, ..., n2 whose longest monotone subsequence is of length n and are therefore extremal for the Erd˝ os-Szekeres theorem. S

Add to Reading List

Source URL: www.math.ucdavis.edu

- Date: 2014-02-10 20:43:57
    2On Distance to Monotonicity and Longest Increasing Subsequence of a Data Stream Funda Ergun∗ Abstract In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of

    On Distance to Monotonicity and Longest Increasing Subsequence of a Data Stream Funda Ergun∗ Abstract In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of

    Add to Reading List

    Source URL: www.cs.sfu.ca

    - Date: 2008-02-27 08:43:32
      3Exemplar Longest Common Subsequence Paola Bonizzoni1 , Gianluca Della Vedova2 , Riccardo Dondi1 , Guillaume Fertin3 , and St´ephane Vialette4 1  Dipartimento di Informatica, Sistemistica e Comunicazione, Universit`

      Exemplar Longest Common Subsequence Paola Bonizzoni1 , Gianluca Della Vedova2 , Riccardo Dondi1 , Guillaume Fertin3 , and St´ephane Vialette4 1 Dipartimento di Informatica, Sistemistica e Comunicazione, Universit`

      Add to Reading List

      Source URL: pagesperso.lina.univ-nantes.fr

      - Date: 2009-07-03 08:57:04
        4Noisy FAQ Retrieval Using Longest Common Subsequence Problem Pooja Porwal Aman Jain

        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
          5Approximating Border Length for DNA Microarray Synthesis Cindy Y. Li1 Prudence W.H. Wong1 Qin Xin2 Fencol C.C. Yung3 1  3

          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
          6Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain

          Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain

          Add to Reading List

          Source URL: algo2.iti.kit.edu

          Language: English - Date: 2008-05-15 11:50:35
          71  Exemplar Longest Common Subsequence Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin , Raffaella Rizzi and St´ephane Vialette

          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
          8An 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

          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
          9CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code Zhenmin Li, Shan Lu, Suvda Myagmar and Yuanyuan Zhou Department of Computer Science University of Illinois at Urbana-Champaign, Urbana, IL

          CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code Zhenmin Li, Shan Lu, Suvda Myagmar and Yuanyuan Zhou Department of Computer Science University of Illinois at Urbana-Champaign, Urbana, IL

          Add to Reading List

          Source URL: www.cpe.virginia.edu

          Language: English - Date: 2016-06-17 11:35:33
          10What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1  2

          What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

          Add to Reading List

          Source URL: pagesperso.lina.univ-nantes.fr

          Language: English - Date: 2009-07-03 08:56:58