Extremal alignments in LCS-inference

DOI10.1111/SJOS.70086MaRDI QIDQ7313915zbMATH OpenFDO

Authors J. Lember, Joonas Sova

Publication date 13 August 2026

Published in Scandinavian Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/SJOS.70086

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Artificial higher order neural networks for economics and business.
• Biological Sequence Analysis
• Bounding the expected length of longest common subsequences and forests
• Concentration inequalities for Markov chains by Marton couplings and spectral methods
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• Improved bounds on the average length of longest common subsequences
• Lower bounds for moments of global scores of pairwise Markov chains
• On a speculated relation between Chvàtal-Sankoff constants of several sequences
• On the rate of convergence for the length of the longest common subsequences in hidden Markov models
• Optimal alignments of longest common subsequences and their path properties
• Pairwise Markov models and hybrid segmentation approach
• The rate of convergence of the mean length of the longest common subsequence
• The rate of the convergence of the mean score in random sequence comparison

This page was built for publication: Extremal alignments in LCS-inference

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