On longest matching consecutive subsequence
From MaRDI portal
Publication:5232179
DOI10.1142/S1793042119500970zbMATH Open1437.11116OpenAlexW2939325193MaRDI QIDQ5232179FDOQ5232179
Authors: Jinjun Li, Xiangfeng Yang
Publication date: 30 August 2019
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793042119500970
Recommendations
- A note on the longest matching consecutive subsequence
- scientific article; zbMATH DE number 6161488
- Longest common subsequences
- On the longest \(k\)-alternating subsequence
- On the longest common parameterized subsequence
- On the Longest Common Parameterized Subsequence
- The longest almost-increasing subsequence
- The Longest Almost-Increasing Subsequence
- On the longest common increasing binary subsequence
- Longest Common Subsequence with Gap Constraints
Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Fractals (28A80)
Cites Work
- Title not available (Why is that?)
- Representations of real numbers by infinite series
- On a new law of large numbers
- Some dimensional results for homogeneous Moran sets
- Longest common subsequences
- On exceptional sets in Erdős-Rényi limit theorem revisited
- On exceptional sets in Erdős-Rényi limit theorem
- New approaches for computer analysis of nucleic acid sequences.
- A remark on exceptional sets in Erdös-Rényi limit theorem
- Hausdorff dimension of the maximal run-length in dyadic expansion.
- Egoroff's theorem and maximal run length
- An Erdős-Rényi law with shifts
- On the shortest distance between orbits and the longest common substring problem
- A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis
- On the longest block in Lüroth expansion
Cited In (6)
- Shortest distance between multiple orbits and generalized fractal dimensions
- Best approximation of orbits in iterated function systems
- Common substring with shifts in \(b\)-ary expansions
- The Hausdorff dimension of the sets of irrationals with prescribed relative growth rates
- A note on the longest matching consecutive subsequence
- On the shortest distance between orbits and the longest common substring problem
This page was built for publication: On longest matching consecutive subsequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232179)