Automata-theoretic models of mutation and alignment
Technical Report
·
OSTI ID:401863
- Univ. of Pennsylvania School of Medicine, Philadelphia, PA (United States)
Finite-state automata called transducers, which have both input and output, can be used to model simple mechanisms of biological mutation. We present a methodology whereby numerically-weighted versions of such specifications can be mechanically adapted to create string edit machines that are essentially equivalent to recurrence relations of the sort that characterize dynamic programming alignment algorithms. Based on this, we have developed a visual programming system for designing new alignment algorithms in a rapid-prototyping fashion.
- Research Organization:
- Stanford Univ., CA (United States)
- OSTI ID:
- 401863
- Report Number(s):
- CONF-9507246-; TRN: 96:005602-0041
- Resource Relation:
- Conference: Intelligent Systems for Molecular Biology (ISMB) conference, Cambridge (United Kingdom), 16-19 Jul 1995; Other Information: PBD: 1995; Related Information: Is Part Of ISMB-95 -- Third international conference on intelligent systems for molecular biology: Proceedings; Rawlings, C.; Clark, D.; Altman, R.; Hunter, L.; Lengauer, T.; Wodak, S. [eds.]; PB: 427 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Project Report on DOE Young Investigator Grant (Contract No. DE-FG02-02ER25525) Dynamic Scheduling and Fusion of Irregular Computation (August 15, 2002 to August 14, 2005)
End-to-end learning of multiple sequence alignments with differentiable Smith–Waterman
CTT: Tools for Fine Alignment of Flash X-ray Systems
Other
·
Tue Aug 16 00:00:00 EDT 2005
·
OSTI ID:401863
End-to-end learning of multiple sequence alignments with differentiable Smith–Waterman
Journal Article
·
Thu Nov 10 00:00:00 EST 2022
· Bioinformatics
·
OSTI ID:401863
+7 more
CTT: Tools for Fine Alignment of Flash X-ray Systems
Technical Report
·
Fri Sep 18 00:00:00 EDT 2020
·
OSTI ID:401863