String reconstruction from substring compositions
Motivated by mass-spectrometry protein sequencing, we consider the problem of
reconstructing a string from the multisets of its substring composition. We show that all …
reconstructing a string from the multisets of its substring composition. We show that all …
The covariogram problem
G Bianchi - Harmonic Analysis and Convexity, 2023 - degruyter.com
The covariogram gX of a measurable set X in ℝn is the function which associates to each
x∈ ℝ n the measure of the intersection of X with X+ x. We are interested in understanding …
x∈ ℝ n the measure of the intersection of X with X+ x. We are interested in understanding …
[HTML][HTML] On the complexity of constructing Golomb rulers
C Meyer, PA Papakonstantinou - Discrete applied mathematics, 2009 - Elsevier
A Golomb Ruler is a ruler with integer marks where the distances between every two marks
are distinct. Golomb Rulers find diverse applications in computer science and electrical …
are distinct. Golomb Rulers find diverse applications in computer science and electrical …
Simplified partial digest problem: enumerative and dynamic programming algorithms
We study the simplified partial digest problem (SPDP), which is a mathematical model for a
new simplified partial digest method of genome mapping. This method is easy for laboratory …
new simplified partial digest method of genome mapping. This method is easy for laboratory …
Covariogram of non-convex sets
C Benassi, G Bianchi, G D'Ercole - Mathematika, 2010 - cambridge.org
The covariogram of a compact set A⊂ ℝn is the function that to each x∈ ℝn associates the
volume of A∩(A+ x). Recently it has been proved that the covariogram determines any …
volume of A∩(A+ x). Recently it has been proved that the covariogram determines any …
Fast algorithms for the simplified partial digest problem
B Wang - Journal of Computational Biology, 2023 - liebertpub.com
The simplified partial digest problem (SPDP) models an effective and robust method for the
building of a physical map using restriction site analysis. The best known algorithm requires …
building of a physical map using restriction site analysis. The best known algorithm requires …
A new dynamic programming algorithm for the simplified partial digest problem
BF Wang - Theoretical Computer Science, 2023 - Elsevier
The simplified partial digest problem (SPDP) models an effective and robust method for
building physical maps using restriction site analysis. Blazewicz and Kasprzak proved that …
building physical maps using restriction site analysis. Blazewicz and Kasprzak proved that …
Parallelizing partial digest problem on multicore system
HM Bahig, MM Abbas, MM Mohie-Eldin - … –28, 2017, Proceedings, Part II 5, 2017 - Springer
The partial digest problem, PDP, is one of the methods used in restriction mapping to
characterize a fragment of DNA. The main challenge of PDP is the exponential time for the …
characterize a fragment of DNA. The main challenge of PDP is the exponential time for the …
The simplified partial digest problem: Approximation and a graph-theoretic model
The goal of the simplified partial digest problem (SPDP) is motivated by the reconstruction of
the linear structure of a DNA chain with respect to a given nucleotide pattern, based on the …
the linear structure of a DNA chain with respect to a given nucleotide pattern, based on the …
Geometric Reconstruction Problems
Many problems from mathematics and engineering can be described in terms of
reconstruction from geometric information. R econstruction $\boldsymbol {Reconstruction} …
reconstruction from geometric information. R econstruction $\boldsymbol {Reconstruction} …