Computational complexity of word counting

DOI10.1007/3-540-45727-5_9MaRDI QIDQ4532071zbMATH OpenFDO

Authors Mireille Régnier

Publication date 28 May 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2066/20660099

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• A unified approach to word occurrence probabilities
• A word counting graph
• Motif statistics. (Abstract)
• On pattern frequency occurrences in a Markovian sequence
• Motif statistics.

Cited in

(3)

• A unified approach to word occurrence probabilities
• Optimal computation of avoided words
• A word counting graph

This page was built for publication: Computational complexity of word counting

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