Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons (Q1194425): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q42612616, #quickstatements; #temporary_batch_1706332928950
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Carlos A. dos Santos Braumann / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Carlos A. dos Santos Braumann / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FASTA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability approximations via the Poisson clumping heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extreme value theory for sequence matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic scrabble: large deviations for sequences with scores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on large deviations for the binomial distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two moments suffice for Poisson approximations: The Chen-Stein method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation and the Chen-Stein method. With comments and a rejoinder by the authors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Rényi law in distribution, for coin tossing and sequence matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation and dna sequence matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Étude des extrêmes d'une suite stationnaire m-dépendante avec une application relative aux accroissements du processus de Wiener. (Study of the extremes of a stationary m-dependent sequence with an application to the increments of Wiener processes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches for computer analysis of nucleic acid sequences. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counts of long aligned word matches among random letter sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4731049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General methods of sequence comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692253 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:11, 16 May 2024

scientific article
Language Label Description Also known as
English
Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons
scientific article

    Statements

    Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    Approximate statistical distributions under the null hypothesis of sequence independence are obtained for certain scores when DNA or protein sequence comparisons are performed. The comparison between two sequences is made on a diagonal and deletions and insertions are not considered. The scores studied are the total number of quality \(q/k\) \(k\)-word matches on a diagonal (number of \(k\)-words with \(q\) or more letter agreements), number of clumps on a diagonal (clumps of the above matches are conveniently defined in the paper), and maximum clump size for all diagonals. The approximate distributions are Poisson, compound Poisson, and integerized extreme value. The theorems also present bounds on the approximations. The paper concludes with some data analysis (including significance tests) and references to open problems.
    0 references
    0 references
    0 references
    0 references
    0 references
    DNA sequence comparisons
    0 references
    extreme value distribution
    0 references
    Poisson approximation
    0 references
    word matches
    0 references
    distribution of order statistics
    0 references
    longest exact matching word
    0 references
    dynamic programming approach
    0 references
    null hypothesis of sequence independence
    0 references
    protein sequence comparisons
    0 references
    approximate distributions
    0 references
    compound Poisson
    0 references
    significance tests
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references