Occurrence of structured motifs in random sequences: arbitrary number of boxes

DOI10.1016/J.DAM.2010.12.023zbMATH Open1227.05026OpenAlexW2055080438MaRDI QIDQ534349FDOQ534349

Authors: Valeri T. Stefanov, Sophie Schbath, Stéphane Robin 

Publication date: 17 May 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.023

Recommendations

• Waiting times for clumps of patterns and for structured motifs in random sequences
• Computing Exact p-Value for Structured Motif
• Publication:4938777
• A unified approach to word occurrence probabilities
• Motif statistics.

zbMATH Keywords

probability generating functionDNA sequencepatternsemi-Markov processstructured motif

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Discrete-time Markov processes on general state spaces (60J05) Markov renewal processes, semi-Markov processes (60K15)

Cites Work

• Title not available (Why is that?)
• Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata
• Exact distribution of the distances between any occurrences of a set of words
• Exact distribution of word occurrences in a random sequence of letters
• A note on occurrence of gapped patterns in i.i.d. Sequences
• Title not available (Why is that?)
• On some waiting time problems
• The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
• Waiting times for clumps of patterns and for structured motifs in random sequences

Cited In (2)

• Computing Exact p-Value for Structured Motif
• String Processing and Information Retrieval

This page was built for publication: Occurrence of structured motifs in random sequences: arbitrary number of boxes

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