Live briefing
Everything about Complete sequence
Sequence of natural numbers
In mathematics, a sequence of natural numbers is called a complete sequence if every positive integer can be expressed as a sum of values in the sequence, using each value at most once. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Complete sequenceA 5-minute orientation
- Skim a recent paper: The complete sequence of a human genomeInfluential work since 2022
- Pick up a classic book: Adams completion and its applications / by Sribatsa NandaThe most-reprinted book on the subject
- Read the landmark paper: MUSCLE: a multiple sequence alignment method with reduced time and space complexityCited 8,061 times
- Go sideways: Fibonacci sequenceA closely related topic
- Go sideways: Zeckendorf's theoremA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
Deciphering the biology of Mycobacterium tuberculosis from the complete genome sequence
The Complete Genome Sequence of Escherichia coli K-12
Complete nucleotide sequence of SV40 DNA
The complete sequence of human preprocalcitonin
From complete genome sequence to ‘complete’ understanding?
Complete genome sequence of bacteriophage T5
Complete sequence of pSC101
🆕 Influential since 2022
The complete sequence of a human genome
The complete sequence of a human Y chromosome
Assessing the contribution of rare variants to complex trait heritability from whole-genome sequence data
Ligilactobacillus salivarius 2102-15 complete genome sequence data
Complete Genome Sequence of Pseudomonas Phage Motto
📚 Books worth reading
- 📕Adams completion and its applications / by Sribatsa NandaSribatsa Nanda · 1979
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Fibonacci sequence In mathematics, the Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the…
- Zeckendorf's theorem Zeckendorf's theorem, named after amateur mathematician Edouard Zeckendorf, is a result about the representation of integers as sums of Fibonacci numbers…
- Fibonacci coding In mathematics and computing, Fibonacci coding is a universal code which encodes positive integers into binary code words. It is one example of representations…
- 68 (number) 68 (sixty-eight) is the natural number following 67 and preceding 69. 68 is a Perrin number. It has an aliquot sum of 58 within an aliquot sequence of…
- Fibonacci prime A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime. The first Fibonacci primes are (sequence A005478 in the OEIS):…
- 177 (number) 177 (one hundred [and] seventy-seven) is the natural number following 176 and preceding 178. One hundred and seventy-seven is the eighth Leyland number…
- Generalizations of Fibonacci numbers In mathematics, the Fibonacci numbers form a sequence defined recursively by: Fn={0n=01n=1Fn−1+Fn−2n>1 That is, after two starting values, each number…
- 92 (number) 92 (ninety-two) is the natural number following 91 and preceding 93. 92 is a composite number of the general form p2q, where q is a higher prime (23).…