Refactor indexing, sampling, and entropy documentation

This commit introduces new theoretical frameworks for k-mer indexing, pair coverage sampling, and sibling partition unification. It also implements new algorithms for calculating family entropy and statistical tests for overlap analysis. Documentation is updated across the board to reflect these new features and theoretical concepts.
This commit is contained in:
Eric Coissac committed 2026-10-13 08:54:21 +02:00
1 parent 95bbc0b2ae
commit 0d12494f1a
12 files changed
+1182 -56

No files matched your search

+89
View File
@@ -768,3 +768,92 @@
pages = {535--563},
year = {1988}
}
@ARTICLE{Le-Cam1960-pe,
title = "{An approximation theorem for the Poisson binomial distribution}",
author = "Le Cam, Lucien",
journal = "Pacific Journal of Mathematics",
publisher = "Mathematical Sciences Publishers",
volume = 10,
number = 4,
pages = "1181--1197",
month = dec,
year = 1960,
url = "http://dx.doi.org/10.2140/pjm.1960.10.1181",
doi = "10.2140/pjm.1960.10.1181",
issn = "0030-8730,1945-5844"
}
@ARTICLE{Hoeffding1956-bx,
title = "{On the distribution of the number of successes in independent
trials}",
author = "Hoeffding, Wassily",
journal = "The Annals of Mathematical Statistics",
publisher = "Institute of Mathematical Statistics",
volume = 27,
number = 3,
pages = "713--721",
abstract = "Let $S$ be the number of successes in $n$ independent trials, and
let $p_j$ denote the probability of success in the $j$th trial,
$j = 1, 2, \cdots, n$ (Poisson trials). We consider the problem
of finding the maximum and the minimum of $Eg(S),$ the expected
value of a given real-valued function of $S,$ when $ES = np$ is
fixed. It is well known that the maximum of the variance of $S$
is attained when $p_1 = p_2 = \cdots = p_n = p.$ This can be
interpreted as showing that the variability in the number of
successes is highest when the successes are equally probable
(Bernoulli trials). This interpretation is further supported by
the following two theorems, proved in this paper. If $b$ and $c$
are two integers, $0 \leqq b \leqq np \leqq c \leqq n,$ the
probability $P(b \leqq S \leqq c)$ attains its minimum if and
only if $p_1 = p_2 = \cdots = p_n = p,$ unless $b = 0$ and $c =
n$ (Theorem 5, a corollary of Theorem 4, which gives the maximum
and the minimum of $P(S \leqq c)$). If $g$ is a strictly convex
function, $Eg(S)$ attains its maximum if and only if $p_1 = p_2 =
\cdots = p_n = p$ (Theorem 3). These results are obtained with
the help of two theorems concerning the extrema of the expected
value of an arbitrary function $g(S)$ under the condition $ES =
np.$ Theorem 1 gives necessary conditions for the maximum and the
minimum of $Eg(S).$ Theorem 2 gives a partial characterization of
the set of points at which an extremum is attained. Corollary 2.1
states that the maximum and the minimum are attained when $p_1,
p_2, \cdots, p_n$ take on, at most, three different values, only
one of which is distinct from 0 and 1. Applications of Theorems 3
and 5 to problems of estimation and testing are pointed out in
Section 5.",
month = sep,
year = 1956,
url = "http://dx.doi.org/10.1214/aoms/1177728178",
doi = "10.1214/aoms/1177728178",
issn = "0003-4851,2168-8990",
language = "en"
}
@ARTICLE{Gleser1975-yu,
title = "{On the distribution of the number of successes in independent
trials}",
author = "Gleser, Leon Jay",
journal = "Annals of Probability",
publisher = "Institute of Mathematical Statistics",
volume = 3,
number = 1,
pages = "182--188",
abstract = "Let $S$ be the number of successes in $n$ independent Bernoulli
trials, where $p_j$ is the probability of success on the $j$th
trial. Let $\mathbf{p} = (p_1, p_2, \cdots, p_n)$, and for any
integer $c, 0 \leqq c \leqq n$, let $H(c \mid \mathbf{p}) = P\{S
\leqq c\}$. Let $\mathbf{p}^{(1)}$ be one possible choice of
$\mathbf{p}$ for which $E(S) = \lambda$. For any $n \times n$
doubly stochastic matrix $\Pi$, let $\mathbf{p}^{(2)} =
\mathbf{p}^{(1)}\Pi$. Then in the present paper it is shown that
$H(c \mid \mathbf{p}^{(1)}) \leqq H(c \mid \mathbf{p}^{(2)})$ for
$0 \leqq c \leqq \lbrack\lambda - 2\rbrack$, and $H(c \mid
\mathbf{p}^{(1)}) \geqq H(c \mid \mathbf{p}^{(2)})$ for
$\lbrack\lambda + 2\rbrack \leqq c \leqq n$. These results
provide a refinement of inequalities for $H(c \mid \mathbf{p})$
obtained by Hoeffding [3]. Their derivation is achieved by
applying consequences of the partial ordering of majorization.",
month = feb,
year = 1975,
url = "http://dx.doi.org/10.2307/2959277",
doi = "10.1214/aop/1176996461",
issn = "0091-1798,2168-894X"
}