A Cross-entropy method for change-point detection in four-letter DNA sequences

Georgy Sofronov; Tatiana Polushina

doi:10.1109/CIBCB.2016.7758099

A Cross-entropy method for change-point detection in four-letter DNA sequences

Georgy Sofronov, Tatiana Polushina

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

3 Citations (Scopus)

Abstract

It is well-known that many genomes are highly structured. So determining domains of similar pattern is a very important area of bioinformatics research. This paper describes a Cross-Entropy algorithm for identifying change-points in fourletter DNA sequences. We propose a multiple change-point model for this problem and show effectiveness of our algorithm for simulated and real biomolecular sequences.

Original language	English
Title of host publication	2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology
Subtitle of host publication	proceedings
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers
Pages	1-6
Number of pages	6
ISBN (Print)	9781467394727
DOIs	https://doi.org/10.1109/CIBCB.2016.7758099
Publication status	Published - 2016
Event	Annual IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (2006) - Chiang Mai, Thailand Duration: 5 Oct 2016 → 7 Oct 2016

Conference

Conference	Annual IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (2006)
City	Chiang Mai, Thailand
Period	5/10/16 → 7/10/16

Keywords

change-point problem
Cross-Entropy method
combinatorial optimization
DNA sequence

Access to Document

10.1109/CIBCB.2016.7758099

Cite this

@inproceedings{10f9b56eae5a4645bd814a45b9dc7ffa,

title = "A Cross-entropy method for change-point detection in four-letter DNA sequences",

abstract = "It is well-known that many genomes are highly structured. So determining domains of similar pattern is a very important area of bioinformatics research. This paper describes a Cross-Entropy algorithm for identifying change-points in fourletter DNA sequences. We propose a multiple change-point model for this problem and show effectiveness of our algorithm for simulated and real biomolecular sequences.",

keywords = "change-point problem, Cross-Entropy method, combinatorial optimization, DNA sequence",

author = "Georgy Sofronov and Tatiana Polushina",

year = "2016",

doi = "10.1109/CIBCB.2016.7758099",

language = "English",

isbn = "9781467394727",

pages = "1--6",

booktitle = "2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology",

publisher = "Institute of Electrical and Electronics Engineers",

note = "Annual IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (2006) ; Conference date: 05-10-2016 Through 07-10-2016",

}

Sofronov, G & Polushina, T 2016, A Cross-entropy method for change-point detection in four-letter DNA sequences. in 2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology: proceedings. Institute of Electrical and Electronics Engineers, Piscataway, NJ, pp. 1-6, Annual IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (2006), Chiang Mai, Thailand, 5/10/16. https://doi.org/10.1109/CIBCB.2016.7758099

A Cross-entropy method for change-point detection in four-letter DNA sequences. / Sofronov, Georgy; Polushina, Tatiana.
2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology: proceedings. Piscataway, NJ: Institute of Electrical and Electronics Engineers, 2016. p. 1-6.

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

TY - GEN

T1 - A Cross-entropy method for change-point detection in four-letter DNA sequences

AU - Sofronov, Georgy

AU - Polushina, Tatiana

PY - 2016

Y1 - 2016

N2 - It is well-known that many genomes are highly structured. So determining domains of similar pattern is a very important area of bioinformatics research. This paper describes a Cross-Entropy algorithm for identifying change-points in fourletter DNA sequences. We propose a multiple change-point model for this problem and show effectiveness of our algorithm for simulated and real biomolecular sequences.

AB - It is well-known that many genomes are highly structured. So determining domains of similar pattern is a very important area of bioinformatics research. This paper describes a Cross-Entropy algorithm for identifying change-points in fourletter DNA sequences. We propose a multiple change-point model for this problem and show effectiveness of our algorithm for simulated and real biomolecular sequences.

KW - change-point problem

KW - Cross-Entropy method

KW - combinatorial optimization

KW - DNA sequence

UR - http://www.scopus.com/inward/record.url?scp=85011422082&partnerID=8YFLogxK

U2 - 10.1109/CIBCB.2016.7758099

DO - 10.1109/CIBCB.2016.7758099

M3 - Conference proceeding contribution

SN - 9781467394727

SP - 1

EP - 6

BT - 2016 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway, NJ

T2 - Annual IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (2006)

Y2 - 5 October 2016 through 7 October 2016

ER -

A Cross-entropy method for change-point detection in four-letter DNA sequences

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this