Name
Abstract | ||
|---|---|---|
Recognition of genes via exon assembly approaches leads naturally to the use of dynamic programming. We consider the general graph-theoretical formulation of the exon assembly problem and analyze in detail some specific variants: multicriterial optimization in the case of non-linear gene-scoring functions; context-dependent schemes for scoring exons and related procedures for exon filtering; and highly specific recognition of arbitrary gene segments, oligonucleotide probes and polymerase chain reaction (PCR) primers.‡‡Described programs are available at http://wwww-hto.usc.edu/software/procrustes/ |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0097-8485(96)00034-4 | Computers & Chemistry |
Keywords | Field | DocType |
score function,oligonucleotide probe,context dependent,polymerase chain reaction | Dynamic programming,Gene,Polymerase chain reaction,Biology,Exon,Oligonucleotide,Bioinformatics,Genetics | Journal |
Volume | Issue | ISSN |
21 | 4 | 0097-8485 |
Citations | PageRank | References |
6 | 0.71 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikhail A. Roytberg | 1 | 114 | 54.66 |
| Tatiana V. Astakhova | 2 | 15 | 2.26 |
| Mikhail S. Gelfand | 3 | 6 | 0.71 |