Aug 2, 2018 · The problem called "String reconstruction from substrings" is a mathematical model of sequencing by hybridization that plays an important role ...
The problem called "String reconstruction from substrings" is a mathematical model of sequencing by hybridization that plays an important role in DNA ...
The problem called "String reconstruction from substrings" is a mathematical model of sequencing by hybridization that plays an important role in DNA ...
We provide tight bounds on the complexity of reconstructing unknown strings from substring queries.
Missing: Randomized Average- Case
Abstract. We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring ...
We investigate a simple reconstruction algorithm called Bitwise Majority Alignment that uses majority voting (with suitable shifts) to determine each bit of the ...
[PDF] Reconstructing Strings from Substrings with Quantum Queries ...
www.semanticscholar.org › paper
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string from its substrings in a certain query ...
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string from its substrings in a certain query ...
Aug 2, 2018 · Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms. Kazuo Iwama1. Junichi Teruyama2. Shuntaro Tsuyama3.
We investigate a simple reconstruction algorithm called Bitwise Majority Alignment that uses majority voting (with suitable shifts) to determine each bit of the ...