Editing Nucleic acid sequence (section)

=== Sequence entropy ===

In [[bioinformatics]], a sequence entropy, also known as sequence complexity or information profile,<ref name="glance">{{Cite journal |last=Pinho |first=A |last2=Garcia, S |last3=Pratas, D |last4=Ferreira, P |date=Nov 21, 2013 |title=DNA Sequences at a Glance. |journal=PLOS ONE |volume=8 |issue=11 |pages=e79922 |bibcode=2013PLoSO...879922P |doi=10.1371/journal.pone.0079922 |pmc=3836782 |pmid=24278218 |doi-access=free}}</ref> is a numerical sequence providing a quantitative measure of the local complexity of a DNA sequence, independently of the direction of processing. The manipulations of the information profiles enable the analysis of the sequences using alignment-free techniques, such as for example in motif and rearrangements detection.<ref name="glance" /><ref name="rearrang">{{Cite journal |last=Pratas |first=D |last2=Silva, R |last3=Pinho, A |last4=Ferreira, P |date=May 18, 2015 |title=An alignment-free method to find and visualise rearrangements between pairs of DNA sequences. |journal=Scientific Reports |volume=5 |pages=10203 |bibcode=2015NatSR...510203P |doi=10.1038/srep10203 |pmc=4434998 |pmid=25984837}}</ref><ref name="troy">{{Cite journal |last=Troyanskaya |first=O |last2=Arbell, O |last3=Koren, Y |last4=Landau, G |last5=Bolshoy, A |date=2002 |title=Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity. |journal=Bioinformatics |volume=18 |pages=679–88 |doi=10.1093/bioinformatics/18.5.679 |pmid=12050064 |doi-access=free |number=5}}</ref>