Live briefing
Everything about K-sorted sequence
Almost-sorted sequence in computer science
In computer science, a nearly-sorted sequence, also known as roughly-sorted sequence and as -sorted sequence is a sequence which is almost ordered. By almost ordered, it is meant that no element of the sequence is very far away from where it would be if the sequence were perfectly ordered. It is still possible that no element of the sequence is at the place where it should be if the sequence were perfectly ordered. Wikipedia ā
š§ Start here: a 6-step reading path
- Read the overview: K-sorted sequenceA 5-minute orientation
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: Self-Sorted, Random, and Block Supramolecular Copolymers via Sequence Controlled, Multicomponent Self-AssemblyCited 243 times
- Go sideways: ReedāSolomon error correctionA closely related topic
- Go sideways: PostBQPA closely related topic
š Definitions
No dictionary entry for this exact phrase.
šļø The subject at a glance
š Landmark papers (most cited)
Self-Sorted, Random, and Block Supramolecular Copolymers via Sequence Controlled, Multicomponent Self-Assembly
Pseudorotaxanes with SelfāSorted Sequence and Stereochemical Orientation
Pseudorotaxanes with SelfāSorted Sequence and Stereochemical Orientation
A novel method for deinterleaving radar signals: Firstāorder difference curve based on sorted TOA difference sequence
Construction and analysis of DNA sequence libraries from flow-sorted chromosomes: practical and theoretical considerations
Sequence-sorted redox-switchable hetero[3]rotaxanes
Sequence-tagged sites (STSs) from YAC insert-ends and X-specific flow-sorted chromosomes
NB-LRR Lineage-Specific Equipment Is Sorted Out by Sequence Pattern Adaptation and Domain Segment Shuffling
š Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. Ā· 1997
Bioinformatics Research and ApplicationsZhipeng Cai Ā· 2013
Foundational Papers in Complexity ScienceDavid Krakauer Ā· 2024
Bibliography of continental drift and plate tectonicsTina Kasbeer Ā· 1972
Introduction to information retrievalChristopher D. Manning, Prabhakar Raghavan Ā· 2008
Algorithm designMichael T. Goodrich, Roberto Tamassia Ā· 2001
MicroRNAs and the immune systemSilvia Monticelli Ā· 2010
Discrete mathematics for computer scienceGary Haggard Ā· 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
š Related topics
- ReedāSolomon error correction In information theory and coding theory, ReedāSolomon codes are a group of error-correcting codes that were introduced by Irving S. Reed and Gustave Solomonā¦
- PostBQP In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantumā¦
- Sequential minimal optimization Sequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support-vectorā¦
- Dirichlet distribution In probability and statistics, the Dirichlet distribution (after Peter Gustav Lejeune Dirichlet), often denoted Dirā”(š¶), is a family of continuous multivariateā¦
- BCH code In coding theory, the BoseāChaudhuriāHocquenghem codes (BCH codes) form a class of cyclic error-correcting codes that are constructed using polynomialsā¦
- LindemannāWeierstrass theorem In transcendental number theory, the LindemannāWeierstrass theorem is a result that is very useful in establishing the transcendence of numbers. It states:ā¦
- Buchholz psi functions Buchholz's psi-functions are a hierarchy of single-argument ordinal functions ĻĪ½(Ī±) introduced by German mathematician Wilfried Buchholz in 1986. Theseā¦
- RobinsonāSchenstedāKnuth correspondence In mathematics, the RobinsonāSchenstedāKnuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijectionā¦