Skip Navigation



Bioinformatics Advance Access published online on April 19, 2005
Bioinformatics, doi:10.1093/bioinformatics/bti451
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
21/13/3051    most recent
bti451v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Nuel, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Nuel, G.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2005). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oupjournals.org
Received February 15, 2005
Revised March 29, 2005
Accepted April 13, 2005

Applications note

S-SPatt: simple statistics for patterns on Markov chains

Grégory Nuel 1*

1 Laboratoire Statistique et Génome, 523 place des terrasses de l'Agora, 91000 Evry, France

* To whom correspondence should be addressed.
Grégory Nuel, E-mail: spatt{at}genopole.cnrs.fr


  Abstract

Summary: S-SPatt allows to count patterns occurrences in text files and, assuming these texts are generated from a random Markovian source, to compute the p-value of a given observation using a simple binomial approximation.

Availability: S-SPatt is available at: http://stat.genopole.cnrs.fr/spatt.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.