Pierre Nicodème  Home/Search
Context Related
| pauillac.inria.fr/algo/n...fastap.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pauillac.inria.fr/...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present in this article a fast approximate method for computing the statistics of number of non self-overlapping matches of motifs in a random text in the non-uniform Bernoulli model. This method is well suited for protein motifs where the probability of self-overlap of motifs is small. For 96% of the Prosite motifs, the expectations of occurrences of the motifs in a 7 million amino-acids random database are computed by the approximate method with less than 1% error when compared with... (Update)
Cited by: More
Proteome Analysis Based on Motif Statistics - Nicodème, Doerks, Vingron (2002) (Correct)
Active bibliography (related documents): More All
0.5: Motif Statistics - Nicodème, Salvy, Flajolet (1999) (Correct)
0.5: An Imaginary Tale: The Story of - Reviewed By Brian (1999) (Correct)
0.3: Regexpcount, a Symbolic Package for Counting Problems on.. - Nicodème (2003) (Correct)
Similar documents based on text: More All
0.7: Unknown - (Correct)
0.5: Genome Comparison - Based On Motif (Correct)
0.4: Regexpcount, a Symbolic Package for - Counting Problems On (Correct)
BibTeX entry: (Update)
Pierre Nicodeme. Fast approximate motif statistics. Journal of Computational Biology, 8(3):235-248, 2001. http://citeseer.ist.psu.edu/nicod01fast.html More
@misc{ nicod01fast,
author = "P. Nicod",
title = "Fast approximate motif statistics",
text = "Pierre Nicodeme. Fast approximate motif statistics. Journal of Computational
Biology, 8(3):235-248, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/nicod01fast.html" }
Citations (may not include all citations):108 An Introduction to the Analysis of Algorithms (context) - Sedgewick, Flajolet - 1996
104 Automata-Theoretic Aspects of Formal Power Series (context) - Salomaa, Soittola - 1978
30 On Pattern Frequency Occurrences in a Markovian Sequence (context) - egnier, Szpankowski - 1998
25 Oxford Science Publications (context) - Titchmarsh - 1939
12 Finding words with unexpected frequencies in deoxyribonuclei.. (context) - Prum, Rodolphe et al. - 1995
11 The average case analysis of algorithms: Counting and genera.. (context) - Flajolet, Sedgewick - 1993
10 Compound Poisson Approximations for Occurrences of Multiple .. (context) - Reinert, Schbath - 1998
9 Patterns in Random Binary Search Trees - Flajolet, Gourdon et al. - 1997
7 Method for calculation of probability of matching a bounded .. (context) - Sewell, Durbin - 1995
5 Linguistic of nucleotide sequences: The signi cance of devia.. (context) - Pevzner, Borodovski et al. - 1989
4 A uni ed approach to words statistics (context) - egnier - 1998
3 Calculating the exact probability of language-like patterns .. (context) - Atteson - 1998
3 Exceptional motifs in di erent Markov chain models for a sta.. (context) - Schbath, Prum et al. - 1995
2 Complex Analysis (context) - Bak, Newman - 1997
1 http://pauillac.inria.fr/algo/papers (context) - eme, Salvy et al. - 1999
1 A First Course on Complex Functions (context) - Jameson - 1970
1 http://protein. toulouse.inra.fr/prodom.html (context) - Sonnhamer, Kahn et al. - 1994
Documents on the same site (http://pauillac.inria.fr/algo/nicodeme/publications.html): More
A Computer Support for Genotyping by PCR-Multiplex - Nicodème, Steyaert (1997) (Correct)
Cover Time and Favourite Points for Planar Random Walks - Dembo (2001) (Correct)
Proteome Analysis Based on Motif Statistics - Nicodème, Doerks, Vingron (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC