Rates of DNA Sequence Profiles for Practical Values of Read Lengths.

Saved in:
Bibliographic Details
Title: Rates of DNA Sequence Profiles for Practical Values of Read Lengths.
Authors: Chang, Zuling1, Chrisnata, Johan2, Ezerman, Martianus Frederic2, Kiah, Han Mao2
Source: IEEE Transactions on Information Theory. Nov2017, Vol. 63 Issue 11, p7166-7177. 12p.
Subjects: Nucleotide sequencing, DNA data banks, DNA synthesis, Nanopores, Macromolecules
Abstract: A recent study by one of the authors has demonstrated the importance of profile vectors in DNA-based data storage. We provide exact values and lower bounds on the number of profile vectors for finite values of alphabet size q , read length \ell , and word length n . Consequently, we demonstrate that for q\ge 2 , the number of profile vectors is at least q^{\kappa n} with \kappa $ very close to 1. In addition to enumeration results, we provide a set of efficient encoding and decoding algorithms for certain families of profile vectors. [ABSTRACT FROM PUBLISHER]
Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:A recent study by one of the authors has demonstrated the importance of profile vectors in DNA-based data storage. We provide exact values and lower bounds on the number of profile vectors for finite values of alphabet size q , read length \ell , and word length n . Consequently, we demonstrate that for q\ge 2 , the number of profile vectors is at least q^{\kappa n} with \kappa $ very close to 1. In addition to enumeration results, we provide a set of efficient encoding and decoding algorithms for certain families of profile vectors. [ABSTRACT FROM PUBLISHER]
ISSN:00189448
DOI:10.1109/TIT.2017.2747557