Archive - Jun 19, 2009

Date
  • All
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13
  • 14
  • 15
  • 16
  • 17
  • 18
  • 19
  • 20
  • 21
  • 22
  • 23
  • 24
  • 25
  • 26
  • 27
  • 28
  • 29
  • 30

Textual data compression in computational biology: a synopsis

Textual data compression in computational biology: a synopsis - Motivation: Textual data compression, and the associated techniques coming from information theory, are often perceived as being of interest for data communication and storage.

Pairagon: a highly accurate, HMM-based cDNA-to-genome aligner

Pairagon: a highly accurate, HMM-based cDNA-to-genome aligner - Motivation: The most accurate way to determine the intron–exon structures in a genome is to align spliced cDNA sequences to the genome. Thus, cDNA-to-genome alignment programs are a key component of most annotation pipelines.

Augmented training of hidden Markov models to recognize remote homologs via simulated evolution

Augmented training of hidden Markov models to recognize remote homologs via simulated evolution - Motivation: While profile hidden Markov models (HMMs) are successful and powerful methods to recognize homologous proteins, they can break down when homology becomes too distant due to lack of sufficien

A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays

A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays - Motivation: High-throughput sequencing technologies place ever increasing demands on existing algorithms for sequence analysis.