Distribution of the length of the longest common subsequence of two multi-state biological sequences

DOI10.1016/j.jspi.2007.03.063zbMath1147.92010OpenAlexW2011889038MaRDI QIDQ947262

W. Y. Wendy Lou, James C. Fu

Publication date: 29 September 2008

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2007.03.063

zbMATH Keywords

finite Markov chain imbeddingtransition probability matrixmulti-state trialsruns and patterns

Mathematics Subject Classification ID

Exact distribution theory in statistics (62E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Biochemistry, molecular biology (92C40)

Related Items (1)

The rate of the convergence of the mean score in random sequence comparison

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sooner and later waiting time problems for Bernoulli trials: Frequency and run quotas
• Non-negative matrices and Markov chains. 2nd ed
• Sooner and later waiting time problems for runs in Markov dependent bivariate trials
• The rate of convergence of the mean length of the longest common subsequence
• Waiting time distributions associated with runs of fixed length in two-state Markov chains
• On a waiting time distribution in a sequence of Bernoulli trials
• An iterative approach to determining the length of the longest common subsequence of two strings
• Runs, scans and urn model distributions: A unified Markov chain approach
• On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials
• Long Common Subsequences and the Proximity of Two Random Strings
• Longest common subsequences of two random sequences
• Distribution Theory of Runs: A Markov Chain Approach
• Sooner waiting time problems in a sequence of trinary trials
• On Runs and Longest Run Tests: A Method of Finite Markov Chain Imbedding
• Sooner and later waiting time problems for patterns in Markov dependent trials
• On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials
• On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
• Matching Sequences under Deletion/Insertion Constraints

This page was built for publication: Distribution of the length of the longest common subsequence of two multi-state biological sequences