Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (Q5439390): Difference between revisions

Latest revision as of 16:35, 27 June 2024

scientific article; zbMATH DE number 5233849

Language	Label	Description	Also known as
English	Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem	scientific article; zbMATH DE number 5233849

Statements

instance of

scholarly article

0 references

title

Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem (English)

0 references

0 references

0 references

RAIRO - Operations Research

0 references

publication date

11 February 2008

0 references

full work available at URL

http://www.numdam.org/item?id=RO_2005__39_4_227_0

0 references

https://eudml.org/doc/105331

0 references

https://semanticscholar.org/paper/fd18abd657ebb23e393b685e10d95299069f76ca

0 references

zbMATH Keywords

combinatorial optimization

0 references

DNA restriction mapping

0 references

partial digest

0 references

computational complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Complexity of DNA sequencing by hybridization.

0 references

LATIN 2004: Theoretical Informatics

0 references

Q4198056

0 references

Mapping DNA by stochastic relaxation

0 references

The NP-completeness column: An ongoing guide

0 references

A lower bound on the number of solutions to the probed partial digest problem

0 references

The restriction mapping problem revisited.

0 references

Q4526776

0 references

Multiple solutions of DNA restriction mapping problems

0 references

Q4401016

0 references

A partial digest approach to restriction site mapping

0 references

Q4315008

0 references

Identifiers

zbMATH Open document ID

1169.90427

0 references

DOI

10.1051/ro:2006007

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5439390

@@ Property / OpenAlex ID @@
+W2152779034
@@ Property / OpenAlex ID: W2152779034 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of DNA sequencing by hybridization.
@@ Property / cites work: Complexity of DNA sequencing by hybridization. / rank @@
+Normal rank
@@ Property / cites work @@
+LATIN 2004: Theoretical Informatics
@@ Property / cites work: LATIN 2004: Theoretical Informatics / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Mapping DNA by stochastic relaxation
@@ Property / cites work: Mapping DNA by stochastic relaxation / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on the number of solutions to the probed partial digest problem
+Normal rank
@@ Property / cites work @@
+The restriction mapping problem revisited.
@@ Property / cites work: The restriction mapping problem revisited. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526776
@@ Property / cites work: Q4526776 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple solutions of DNA restriction mapping problems
+Normal rank
@@ Property / cites work @@
+Q4401016
@@ Property / cites work: Q4401016 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial digest approach to restriction site mapping
+Normal rank
@@ Property / cites work @@
+Q4315008
@@ Property / cites work: Q4315008 / rank @@
+Normal rank