Algorithms

LA home
Computing
Bioinformatics
 Glossary
 Algorithms
  LBI
  Approx.Pali.

also see
 Strings
Numerous algorithmic problems arise in Bioinformatics over and above [alignment], [evolutionary] trees etc..
 
The longest biased interval (LBI) problem is to find long intervals in a sequence that are of biological interest because they have significantly biased base-composition.
 
Approximate palindromes in DNA may code for miRNAs or have other biological functions.
 
Some "classic" Computer Science algorithms and data structures are useful in Bioinformatics, for example,
[suffix trees],
[suffix arrays],
[BWT] (Burrows Wheeler Transform).
www

free:
Linux operating-sys
OpenOffice office-suite, ver. 3.1+
The GIMP ~photoshop
Firefox web browser
FlashBlock flash on/off

© L. Allison   http://www.allisons.org/ll/   (or as otherwise indicated),
Created with "vi (Linux + Solaris)",  charset=iso-8859-1,  fetched Friday, 03-Sep-2010 13:27:52 EST.