Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Word match counts between markovian biological sequences

dc.contributor.authorBurden, Conrad
dc.contributor.authorLeopardi, Paul
dc.contributor.authorForet, Sylvain
dc.date.accessioned2015-12-10T22:30:37Z
dc.date.issued2014
dc.date.updated2016-02-24T08:07:12Z
dc.description.abstractThe D2 statistic, which counts the number of word matches between two given sequences, has long been proposed as a measure of similarity for biological sequences. Much of the mathematically rigorous work carried out to date on the properties of the D2 statistic has been restricted to the case of ‘Bernoulli’ sequences composed of identically and independently distributed letters. Here the properties of the distribution of this statistic for the biologically more realistic case of Markovian sequences is studied. The approach is novel in that Markovian dependency is defined for sequences with periodic boundary conditions, and this enables exact analytic formulae for the mean and variance to be derived. The formulae are confirmed using numerical simulations, and asymptotic approximations to the full distribution are tested.
dc.identifier.issn9876-5432
dc.identifier.urihttp://hdl.handle.net/1885/55170
dc.publisherZZZ Scopus Publisher
dc.sourceCommunications in Computer and Information Science
dc.titleWord match counts between markovian biological sequences
dc.typeJournal article
local.bibliographicCitation.lastpage161
local.bibliographicCitation.startpage147
local.contributor.affiliationBurden, Conrad, College of Physical and Mathematical Sciences, ANU
local.contributor.affiliationLeopardi, Paul, College of Physical and Mathematical Sciences, ANU
local.contributor.affiliationForet, Sylvain, College of Medicine, Biology and Environment, ANU
local.contributor.authoruidBurden, Conrad, u1571037
local.contributor.authoruidLeopardi, Paul, u1576990
local.contributor.authoruidForet, Sylvain, u2509242
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor010300 - NUMERICAL AND COMPUTATIONAL MATHEMATICS
local.identifier.absfor010400 - STATISTICS
local.identifier.absfor060409 - Molecular Evolution
local.identifier.ariespublicationa383154xPUB321
local.identifier.doi10.1007/978-3-662-44485-6_11
local.identifier.scopusID2-s2.0-84916241399
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
01_Burden_Word_match_counts_between_2014.pdf
Size:
643.13 KB
Format:
Adobe Portable Document Format