The simplified partial digest problem: Approximation and a graph-theoretic model

A new uniform algorithm based on sequential removal of redundancy from inputs is proposed to solve the turnpike and beltway problems. For error-free inputs that simulate experimental data with high accuracy, the size of inputs decreases from [Formula: see text] to [Formula: see text], which permits one to eliminate exhaustive search almost completely and reconstruct sequences in [Formula: see text] steps. Computational experiments show high efficiency of the algorithm for both the turnpike and beltway cases, with the reconstruction time for sequences of lengths up to several thousand elements being within 1 second on a modern PC.

show abstract

Fast Algorithms for the Simplified Partial Digest Problem

Wang

2023

Journal of Computational Biology

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

The simplified partial digest problem: Approximation and a graph-theoretic model

Cited by 4 publications

References 24 publications

A new dynamic programming algorithm for the simplified partial digest problem

A new dynamic programming algorithm for the simplified partial digest problem

A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n² Pairwise Distances in n² Steps for the Sequencing Problem: II. Algorithm

Fast Algorithms for the Simplified Partial Digest Problem

Contact Info

Product

Resources

About

The simplified partial digest problem: Approximation and a graph-theoretic model

Cited by 4 publications

References 24 publications

A new dynamic programming algorithm for the simplified partial digest problem

A new dynamic programming algorithm for the simplified partial digest problem

A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n2 Pairwise Distances in n2 Steps for the Sequencing Problem: II. Algorithm

Fast Algorithms for the Simplified Partial Digest Problem

Contact Info

Product

Resources

About

A Simple Approach to the Reconstruction of a Set of Points from the Multiset of n² Pairwise Distances in n² Steps for the Sequencing Problem: II. Algorithm