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

摘要

Abstract 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 documentclass{aastex}usepackage{amsbsy}usepackage{amsfonts}usepackage{amssymb}usepackage{bm}usepackage{mathrsfs}usepackage{pifont}usepackage{stmaryrd}usepackage{textcomp}usepackage{portland, xspace}usepackage{amsmath, amsxtra}pagestyle{empty}DeclareMathSizes{10}{9}{7}{6}egin{document} $$O ( {n^2} )$$ end{document} to documentclass{aastex}usepackage{amsbsy}usepackage{amsfonts}usepackage{amssymb}usepackage{bm}usepackage{mathrsfs}usepackage{pifont}usepackage{stmaryrd}usepackage{textcomp}usepackage{portland, xspace}usepackage{amsmath, amsxtra}pagestyle{empty}DeclareMathSizes{10}{9}{7}{6}egin{document} $$O ( n )$$ end{document}, which permits one to eliminate exhaustive search almost completely and reconstruct sequences in document..." /> rel="meta" type="application/atom+xml" href="http://dx.doi.org/10.1089%2Fcmb.2016.0046" /> rel="meta" type="application/rdf+json" href="http://dx.doi.org/10.1089%2Fcmb.2016.0046" /> rel="meta" type="application/unixref+xml" href="http://dx.doi.org/10.1089%2Fcmb.2016.0046" /> 展开▼