- sequencing problem
- мат. задача упорядочения
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Sequencing — For the sense of sequencing used in electronic music, see the music sequencer article. For sequence learning in cognitive science, see sequence learning. In genetics and biochemistry, sequencing means to determine the primary structure (sometimes … Wikipedia
Problem der exakten Überdeckung — Das Problem der exakten Überdeckung (englisch Exact Cover) ist ein Entscheidungsproblem der Kombinatorik. Es gehört zu den 21 klassischen NP vollständigen Problemen, von denen Richard M. Karp 1972 gezeigt hat, dass sie NP vollständig sind.… … Deutsch Wikipedia
Sequencing-Batch-Reactor-Verfahren — Das Belebtschlammverfahren (auch kurz Belebungsverfahren; engl.: activated sludge process) ist ein Verfahren zur biologischen Abwasserreinigung in Kläranlagen. Dabei wird das zumeist kommunale Abwasser durch die Stoffwechsel Aktivität von aeroben … Deutsch Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
DNA sequencing theory — is the broad body of work that attempts to lay analytical foundations for DNA sequencing. The practical aspects revolve around designing and optimizing sequencing projects (known as strategic genomics ), predicting project performance,… … Wikipedia
Nanopore sequencing — is a method under development since 1995 [1][2] for determining the order in which nucleotides occur on a strand of DNA. A nanopore is simply a small hole, of the order of 1 nanometer in internal diameter. Certain transmembrane cellular proteins… … Wikipedia
Protein sequencing — Proteins are found in every cell and are essential to every biological process, protein structure is very complex: determining a protein s structure involves first protein sequencing determining the amino acid sequences of its constituent… … Wikipedia
DNA sequencing — Part of a series on Genetics Key components Chromosome DNA • RNA Genome Heredity Mutation Nucleotide Variation … Wikipedia
Cutting stock problem — The cutting stock problem is an optimization problem, or more specifically, an integer linear programming problem. It arises from many applications in industry. Imagine that you work in a paper mill and you have a number of rolls of paper of… … Wikipedia
Bisulfite sequencing — Figure 1: Outline of bisulfite conversion of sample sequence of genomic DNA. Nucleotides in blue are unmethylated cytosines converted to uracils by bisulfite, while red nucleotides are 5 methylcytosines resistant to conversion … Wikipedia
Hitting-Set-Problem — Das Hitting Set Problem ist ein NP vollständiges Problem aus der Mengentheorie. Es gehört zur Liste der 21 klassischen NP vollständigen Probleme von denen Richard M. Karp 1972 die Zugehörigkeit zu dieser Klasse zeigen konnte. Gegeben ist eine… … Deutsch Wikipedia