Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Establishing a framework for comparative analysis of genome sequences
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
Non-deterministic, constraint-based parsing of human genes
Non-deterministic, constraint-based parsing of human genes
| Hi-index | 0.00 |
This paper describes an application of the logic programming paradigm to large-scale comparison of complete microbial genomes each containing four-million amino acid characters and approximately two thousand genes. We present algorithms and a Sicstus Prolog based implementation to model genome comparisons as bipartite graph matching to identify orthologs-- genes across different genomes with the same function -- and groups of orthologous genes -- orthologous genes in close proximity, and gene duplications. The application is modular, and integrates logic programming with Unix-based programming and a Prolog based text-processing library developed during this project. The scheme has been successfully applied to compare eukaryotes such as yeast. The data generated by the software is being used by microbiologists and computational biologists to understand the regulation mechanisms and the metabolic pathways in microbial genomes.