[Computers and Chemistry, Vol. 24 (1) (2000) pp. 43-55]

Sequence complexity for biological sequence analysis

LA home

Also see

L. Allisona, L. Sternb, T. Edgoosea and T.I. Dixa

(a) School of Computer Science and Software Engineering, Monash University, Melbourne, 3168 Australia
(b) Department of Computer Science and Software Engineering, The University of Melbourne, Melbourne, 3052 Australia
Received 7 August 1998; accepted 18 February 1999

Full paper here: [10.1016/S0097-8485(00)80006-6][4/'03], [sciencedirect(click)][4/'03].

Abstract: A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instances of repeats do not need to match each other exactly. Both forward- and reverse-complementary repeats are allowed. The model has a small number of parameters which are fitted to the data. In general there are many explanations for a given sequence and how to compute the total probability of the data given the model is shown. Computer algorithms are described for these tasks. The model can be used to compute the information content of a sequence, either in total or base by base. This amounts to looking at sequences from a data-compression point of view and it is argued that this is a good way to tackle intelligent sequence analysis in general.

Keywords: Algorithm; DNA; Complexity; Entropy; Pattern discovery; Sequence analysis

(Also see ISMB'98, pp.8-16, 1998 and Mol. Biochem, Parasitology, 18(2), pp.175-186, 2001.)

www #ad:

↑ © L. Allison, www.allisons.org/ll/   (or as otherwise indicated).
Created with "vi (Linux)",  charset=iso-8859-1,   fetched Saturday, 24-Feb-2024 21:43:38 UTC.

Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off.