PAG-IX: OPTIMAL ALGORITHM SELECTION FOR BIOINFORMATICS

PAG-IX   Plant & Animal Genome IX Conference

Town & Country Hotel, San Diego, CA, January 13-17, 2001.


Workshop: Bioinformatics/Computers
W15_02.html

OPTIMAL ALGORITHM SELECTION FOR BIOINFORMATICS

MARTIN GOLLERY,

TimeLogic Corporation, 880 Northwood, Incline Village, Nevada 89451, USA.

Whether obtained in-house or purchased from the private sector, Genomic sequence data is expensive to obtain. To optimize the benefit that one receives from this data, the choice of the proper analytical technique is absolutely crucial. Unfortunately, there is no single solution that provides the best results for all researchers. Instead, the benefits of each algorithm must be weighed against the costs and other negatives of that method. In this talk, I will present many of the commonly used algorithms with a brief introduction of how they work and what they are best used for. Positive and negative features will be listed for all algorithms. Other topics that will be covered include: -Databases: Nucleic and amino, public and private -Commercial web portals -Bioinformatics accelerators -Genefinding tools -Pipeline building Examples will be given from my own research, and from other Bioinformatics groups from around the world.


Return to Previous Page or Intl-PAG Homepage