{
  "id": "0911.2031",
  "version": "v4",
  "published": "2009-11-10T23:59:41.000Z",
  "updated": "2016-04-20T23:23:20.000Z",
  "title": "Closeness to the Diagonal for Longest Common Subsequences in Random Words",
  "authors": [
    "C. Houdré",
    "H. Matzinger"
  ],
  "comment": "Final version to appear in ECP, 2016",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "The nature of the alignment with gaps corresponding to a longest common subsequence (LCS) of two independent iid random sequences drawn from a finite alphabet is investigated. It is shown that such an optimal alignment typically matches pieces of similar short-length. This is of importance in understanding the structure of optimal alignments of two sequences. Moreover, it is also shown that any property, common to two subsequences, typically holds in most parts of the optimal alignment whenever this same property holds, with high probability, for strings of similar short-length. Our results should, in particular, prove useful for simulations since they imply that the re-scaled two dimensional representation of a LCS gets uniformly close to the diagonal as the length of the sequences grows without bound.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2014-08-05T01:41:01.000Z",
      "title": "Closeness to the Diagonal for Longest Common Subsequences",
      "abstract": "The nature of the alignment with gaps corresponding to a Longest Common Subsequence (LCS) of two independent iid random sequences drawn from a finite alphabet is investigated. It is shown that such an optimal alignment typically matches pieces of similar length. This is of importance to understand the structure of optimal alignments of two sequences. Moreover, it is also shown that a property, common to two subsequences, typically holds in most parts of the optimal alignment whenever this same property holds, with high probability, for strings of similar short length. Our results should, in particular, prove useful for simulations since they imply that the re-scaled two dimensional representation of the LCS gets uniformly close to the diagonal as the length of the sequences grows without bound.",
      "comment": "Updated manuscript",
      "journal": null,
      "doi": null
    },
    {
      "version": "v4",
      "updated": "2016-04-20T23:23:20.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05A05",
      "60C05",
      "60F10"
    ],
    "keywords": [
      "longest common subsequence",
      "independent iid random sequences drawn",
      "optimal alignment typically matches pieces"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0911.2031H"
    }
  }
}