Reconstruction of a string from substring precedence data

The problem of reconstructing of a symbol string given the data about precedence of fixed length substrings arises in the method of nucleic acid sequencing by nested strand hybridization. We reformulate the problem in the graph-theoretical terms, describe the structure of the set of solutions, and p...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational biology Vol. 2; no. 2; p. 371
Main Authors Rubinov, A R, Gelfand, M S
Format Journal Article
LanguageEnglish
Published United States 1995
Subjects
Algorithms
Base Sequence
DNA - chemistry
Models, Theoretical
Molecular Sequence Data
Nucleic Acid Hybridization
Oligodeoxyribonucleotides
Online AccessGet more information

Cover

More Information
Summary:The problem of reconstructing of a symbol string given the data about precedence of fixed length substrings arises in the method of nucleic acid sequencing by nested strand hybridization. We reformulate the problem in the graph-theoretical terms, describe the structure of the set of solutions, and present polynomial time algorithms that check existence and uniqueness of a solution or finiteness of the solution set, and then construct the solutions.
ISSN:1066-5277
DOI:10.1089/cmb.1995.2.371