COMBINATORIAL APPROACHES TO GENE RECOGNITION

Recognition of genes via exon assembly approaches leads naturally to t he use of dynamic programming. We consider the general graph-theoretic al formulation of the exon assembly problem and analyze in detail some specific variants: multicriterial optimization in the case of non-lin ear gene-scoring functions; context-dependent schemes for scoring exon s and related procedures for exon filtering; and highly specific recog nition of arbitrary gene segments, oligonucleotide probes and polymera se chain reaction (PCR) primers. (C) 1997 Elsevier Science.