← Back
Home › Systems › Biotech and life sciences

plant-breeding-platform

plant breeding data and genomic selection platform

Breedbase, Integrated Breeding Platform, CGIAR EBS

SystemTechniques · 12Primitives · 27 plant-breeding-platform Offline mutation queuedistributed · medium: Apply actions locally at once and queue them durably; on reconnect replay the queue idempotently, then re-apply unconfirmed ones on the server state.›Kriging spatial interpolationgeometry · medium: Variogram-based kriging and IDW to interpolate sampled field values onto gridsTransitive closure indexgraphs · medium: Segment/interval labelling of DAGs (commit graphs) for fast reachability queriesQuadratic programmingoptimization · medium: Convex QP solvers (active-set, interior-point, ADMM) for constrained optimizationGenotype imputation hmmsearch-sort · medium: Li-Stephens haplotype-copying HMM: infer missing genotypes from a reference panel with forward-backward over haplotype statesLinear mixed model blupstatistics · medium: Solve Henderson mixed-model equations for best linear unbiased predictions of breeding values with estimated variance componentsPedigree relationship matrixstatistics · medium: Additive relationship matrix from pedigrees by the tabular method, and its sparse inverse via Henderson rulesLU and Cholesky factorizationnumerics · low: Factor A = PLU (any square matrix, partial pivoting) or A = LLᵀ (SPD) once in O(n³), then solve each right-hand side in O(n²).›Sparse matrices (CSR)numerics · low: Compressed sparse row stores only nonzeros as row pointers, column indices and values; SpMV streams them once, so it is memory-bandwidth bound.›Barcode symbologiesdata-structures · low: Encode/decode 1D and 2D barcodes (Code 128, DataMatrix, QR) with their error correctionVcf variant normalizationsearch-sort · low: Parse VCF and left-align/trim indels so equal variants share one representationAuthorization models (RBAC, ABAC, R…security · low: How to decide who may do what to which object; roles for coarse rules, relationships for sharing, and checks on every object.›Entity attribute value schemastorage · low: Schema-flexible EAV / JSON entity storage with typed attribute catalogs and indexesIdempotency keysfinance · low: Client-chosen unique key per logical operation, stored with a request fingerprint and the final response, so retries replay the first result instead of acting twice.›Optimistic concurrency controlstorage · low: Run transactions without locks, record what they read, and validate at commit that nothing changed; fastest when conflicts are rare.›Exponential backoff with jittersystems · low: Retry after delays that grow geometrically and are randomized, so failed clients spread out instead of hammering a recovering service in synchronized waves.›k-d treegeometry · low: A binary tree that splits k-dimensional points by one coordinate per level, giving fast nearest-neighbour and box queries on static low-dimensional data.›Gaussian processesmachine-learning · low: GP regression with kernels: posterior mean/variance via Cholesky, hyperparameters by marginal likelihoodInterval treedata-structures · low: Index of ranges that answers "which intervals overlap this point or range?" in O(log n + k); static sorted-array form is the compact, cache-friendly choice.›BFS and DFSgraphs · low: The two basic graph traversals; BFS gives hop distances and levels, DFS gives discovery/finish order for cycles, components and topological order.›Topological sortgraphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.›Object storagecloud · low: S3-compatible blob storage at cents per GB-month with 11 nines durability; pick by egress price, request price and latency, not by storage price alone.›Delta encodingcompression · low: Store differences between consecutive values instead of the values, turning sorted IDs, timestamps and counters into small numbers that pack into few bits.›+ 5 more techniques+ 11 more primitives