A characterization of the number of subsequences obtained via the deletion channel

Y. Liron; M. Langberg

doi:10.1109/ISIT.2012.6284240

A characterization of the number of subsequences obtained via the deletion channel

Y. Liron
, M. Langberg

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Motivated by the study of deletion channels, this work presents improved bounds on the number of subsequences obtained from a binary sting X of length n under t deletions. It is known that the number of subsequences in this setting strongly depends on the number of runs in the string X; where a run is a maximal sequence of the same character. Our improved bounds are obtained by a structural analysis of the family of r-run strings X, an analysis in which we identify the extremal strings with respect to the number of subsequences. Specifically, for every r, we present r-run strings with the minimum (respectively maximum) number of subsequences under any t deletions; and perform an exact analysis of the number of subsequences of these extremal strings.

Original language	English
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	503-507
Number of pages	5
ISBN (Print)	9781467325790
DOIs	https://doi.org/10.1109/ISIT.2012.6284240
State	Published - 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095
ISSN (Electronic)	2157-8117

Conference

Conference	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	1/07/12 → 6/07/12

Access to Document

10.1109/ISIT.2012.6284240

Cite this

Liron, Y., & Langberg, M. (2012). A characterization of the number of subsequences obtained via the deletion channel. In 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 (pp. 503-507). Article 6284240 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2012.6284240

@inproceedings{409314e7c9814ab29b0dfad52ac293a9,

title = "A characterization of the number of subsequences obtained via the deletion channel",

abstract = "Motivated by the study of deletion channels, this work presents improved bounds on the number of subsequences obtained from a binary sting X of length n under t deletions. It is known that the number of subsequences in this setting strongly depends on the number of runs in the string X; where a run is a maximal sequence of the same character. Our improved bounds are obtained by a structural analysis of the family of r-run strings X, an analysis in which we identify the extremal strings with respect to the number of subsequences. Specifically, for every r, we present r-run strings with the minimum (respectively maximum) number of subsequences under any t deletions; and perform an exact analysis of the number of subsequences of these extremal strings.",

author = "Y. Liron and M. Langberg",

year = "2012",

doi = "10.1109/ISIT.2012.6284240",

language = "אנגלית",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "503--507",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

address = "ארצות הברית",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

Liron, Y & Langberg, M 2012, A characterization of the number of subsequences obtained via the deletion channel. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6284240, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 503-507, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 1/07/12. https://doi.org/10.1109/ISIT.2012.6284240

A characterization of the number of subsequences obtained via the deletion channel. / Liron, Y.; Langberg, M.
2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012. Institute of Electrical and Electronics Engineers Inc., 2012. p. 503-507 6284240 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A characterization of the number of subsequences obtained via the deletion channel

AU - Liron, Y.

AU - Langberg, M.

PY - 2012

Y1 - 2012

N2 - Motivated by the study of deletion channels, this work presents improved bounds on the number of subsequences obtained from a binary sting X of length n under t deletions. It is known that the number of subsequences in this setting strongly depends on the number of runs in the string X; where a run is a maximal sequence of the same character. Our improved bounds are obtained by a structural analysis of the family of r-run strings X, an analysis in which we identify the extremal strings with respect to the number of subsequences. Specifically, for every r, we present r-run strings with the minimum (respectively maximum) number of subsequences under any t deletions; and perform an exact analysis of the number of subsequences of these extremal strings.

AB - Motivated by the study of deletion channels, this work presents improved bounds on the number of subsequences obtained from a binary sting X of length n under t deletions. It is known that the number of subsequences in this setting strongly depends on the number of runs in the string X; where a run is a maximal sequence of the same character. Our improved bounds are obtained by a structural analysis of the family of r-run strings X, an analysis in which we identify the extremal strings with respect to the number of subsequences. Specifically, for every r, we present r-run strings with the minimum (respectively maximum) number of subsequences under any t deletions; and perform an exact analysis of the number of subsequences of these extremal strings.

UR - https://www.scopus.com/pages/publications/84867533197

U2 - 10.1109/ISIT.2012.6284240

DO - 10.1109/ISIT.2012.6284240

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84867533197

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 503

EP - 507

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

A characterization of the number of subsequences obtained via the deletion channel

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this