Srinivasan, P. Computational Algorithms for Multiple Molecular Sequence Analysis, M.S. Thesis of Computer Science, University of Texas at San Antonio, December, 1991. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
MIN-Graph: A Tool for Monitoring and Visualizing MIN-based.. - Zhang, Nalluri, al. (1993) (Correct)
....by flanking them with other identity blocks in both directions to form longer matches, allowing interruption by small error blocks. Fourth, maximally extended matches which meet the prescribed printing criteria will be produced in the output file. This algorithm has been implemented by Srinivasan [18] on the BBN TC2000. The three phases of the matching algorithm constructing the pointer array, finding the core blocks and extending core blocks with errors have been developed in parallel forms. Figure 3 shows the final snapshots of workload windows and concurrency graph windows of two ....
Srinivasan, P. Computational Algorithms for Multiple Molecular Sequence Analysis, M.S. Thesis of Computer Science, University of Texas at San Antonio, December, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC