An efficient statistic to detect over- and under-represented words in DNA sequences.

Journal of computational biology : a journal of computational molecular cell biology ·Vol. 4 ·No. 2 ·1997-00-00 ·Pages 189-92

Schbath S

Abstract

In this note, we point out a very efficient statistic to detect over- and under-represented words in DNA sequences, when Markov chain models are used to represent the sequences. This statistic is missing from the recent review done on this important problem and appears to be a better measure of rarity and abundance of words in DNA sequences.

MeSH Terms

Algorithms DNA/genetics Markov Chains Models, Statistical

Chemicals

DNA

Authors & Affiliations

1 authors, click to expand affiliations / ORCID

Schbath S

I.N.R.A., Unité de Biométrie, Jouy-en-Josas, France. Sophie.Schbath@jouy.inra.fr

Article Info

Journal

Journal of computational biology : a journal of computational molecular cell biology

Abbr.

J Comput Biol

ISSN

1066-5277

DOI

10.1089/cmb.1997.4.189

sophie.schbath@jouy.inra.fr

Published

1997-00-00

Pages

189-92

Language

English

Region

United States

NLM ID

9433358

Subset

Corrections

CommentOn

PMID: 8891954

External Links

PubMed source DOI: 10.1089/cmb.1997.4.189 View journal details

Analysis Services

An efficient statistic to detect over- and under-represented words in DNA sequences.

Contact

WeChat Official Account