Sparse long blocks and the micro-structure of the longuest common subsequences

DOI10.1007/S10955-014-0938-6zbMATH Open1291.82053arXiv1204.1005OpenAlexW2106018628MaRDI QIDQ2249281FDOQ2249281

Christian Houdré, Heinrich Matzinger, Saba Amsalu

Publication date: 10 July 2014

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: Consider two random strings having the same length and generated by an iid sequence taking its values uniformly in a fixed finite alphabet. Artificially place a long constant block into one of the strings, where a constant block is a contiguous substring consisting only of one type of symbol. The long block replaces a segment of equal size and its length is smaller than the length of the strings, but larger than its square-root. We show that for sufficiently long strings the optimal alignment corresponding to a Longest Common Subsequence (LCS) treats the inserted block very differently depending on the size of the alphabet. For two-letter alphabets, the long constant block gets mainly aligned with the same symbol from the other string, while for three or more letters the opposite is true and the block gets mainly aligned with gaps. We further provide simulation results on the proportion of gaps in blocks of various lengths. In our simulations, the blocks are "regular blocks" in an iid sequence, and are not artificially inserted. Nonetheless, we observe for these natural blocks a phenomenon similar to the one shown in case of artificially-inserted blocks: with two letters, the long blocks get aligned with a smaller proportion of gaps; for three or more letters, the opposite is true. It thus appears that the microscopic nature of two-letter optimal alignments and three-letter optimal alignments are entirely different from each other.

Full work available at URL: https://arxiv.org/abs/1204.1005

Mathematics Subject Classification ID

Percolation (82B43)

Cites Work

• Title not available (Why is that?)
• Expected length of the longest common subsequence for large alphabets
• Approximation of subadditive functions and convergence rates in limiting-shape results
• The rate of convergence of the mean length of the longest common subsequence
• Longest common subsequences of two random sequences
• Improved bounds on the average length of longest common subsequences
• General methods of sequence comparison
• Sparse long blocks and the micro-structure of the longuest common subsequences
• On the Limiting Shape of Young Diagrams Associated With Markov Random Words

Cited In (5)

• Small Longest Tandem Scattered Subsequences
• On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words
• Title not available (Why is that?)
• Lower bounds on the generalized central moments of the optimal alignments score of random sequences
• Sparse long blocks and the micro-structure of the longuest common subsequences

   Recommendations

• Title not available (Why is that?) 👍 👎
• On the longest common subsequence of conjugation invariant random permutations 👍 👎
• On the approximation of longest common nonsupersequences and shortest common nonsubsequences 👍 👎
• Repetition-free longest common subsequence of random sequences 👍 👎
• Longest common subsequence in sublinear space 👍 👎
• Large deviations-based upper bounds on the expected relative length of longest common subsequences 👍 👎
• Title not available (Why is that?) 👍 👎
• On the longest common parameterized subsequence 👍 👎
• On the Longest Common Parameterized Subsequence 👍 👎
• A note on the expected length of the longest common subsequences of two i.i.d. random permutations 👍 👎

This page was built for publication: Sparse long blocks and the micro-structure of the longuest common subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249281)