Parods—a study of parallel algorithms for ordering dna sequences

Bioinformatics

Volumn 12, Issue 4, 1996, Pages 269-280

  Bhandarkar, Suchendra M ^b   Chirravuri, Sridhar ^b   Arnold, Jonathan ^a  

^a University of Georgia ^*  (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; DNA SEQUENCE; PRIORITY JOURNAL; PROBABILITY;

ALGORITHMS; ASPERGILLUS NIDULANS; COMPUTER SIMULATION; COMPUTERS; DNA; DNA, FUNGAL; HUMANS; MARKOV CHAINS; NUCLEIC ACID HYBRIDIZATION; SEQUENCE ANALYSIS, DNA;

EID: 0029958019     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/12.4.269     Document Type: Article

References (39)

1. Aarts, E.H.L. and Korst, K. (1989) Simulated Annealing and Boltzman Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. John Wiley Inc., New York.
2. Aarts.E.H.L., de Bont, F.M.J., HabersJ.H.A. and van Laarhoven.P.J.M. (1986) A parallel statistical cooling algorithm. In Lecture Notes in Computer Science: Proceedings of the 3rd Annual Symp. Theoretical Aspects of Computer Science. Springer-Verlag, Berlin, 210, pp. 87-97.
3. Azencott, R. (ed.) (1992) Simulated Annealing: Parallelization Techniques. John Wiley Inc., New York.
4. Banerjee, P., Jones.M.H. and SargentJ.S. (1990) Parallel simulated annealing algorithms for cell placement on the hypercube multiprocessor. IEEE Trans. Parallel Distrib. Syst., 1, 91-106.
5. Bhandarkar, S.M. and Arnold, J. (1994) Parallel simulated annealing on the hypercube for chromosome reconstruction. In Proceedings of the IMACS 14 th World Congress on Computational and Applied Mathematics, 3, IMACS Press, New York, pp. 1109-1112.
6. Bhandarkar, S.M., Chirravuri, S., Arnold, J. and Whitmire, D. (1996) Massively parallel algorithms for chromosome reconstruction. In Proceedings of a Pacific Symposium on Biocomputing, World Sci. Pub., Singapore, pp. 85-92.
7. Boissin.N. and LuttonJ. L. (1993) A parallel simulated annealing algorithm. Parallel Comput. 19, 859-872.
8. Booth.K.S. and Lueker.G.S. (1976) Testing for the consecutive one's property, interval graphs and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci., 13, 335-379.
9. Carriero.N. and Gelemter.D. (1988) Applications experience with Linda. In Proceedings of the ACM Symposium on Parallel Programming. ACM Press, New York, pp. 173-187.
10. Casotto, A., Romeo, F. and Sangiovanni-Vincentelli, A. (1987) A parallel simulated annealing algorithm for the placement of macro cells. IEEE Trans. Computer-Aided Design, 9, 838-847.
11. Collins.F. and Galas.D. (1993) A new five-year plan for the U.S. human genome project. Science, 262, 53-56.
12. Cuticchia.A.J., Arnold, J, and Timberlake, W.E. (1992) The use of simulated annealing in chromosome reconstruction experiments based on binary scoring. Genetics, 132, 591-601.
13. Cuticchia.A.J., Arnold, J, and Timberlake.W.E. (1993) ODS: ordering DNA sequences—a physical mapping algorithm based on simulated annealing. Comput. Applic. Biosci., 9, 215-219.
14. Date, S., Kulkami, R., Kulkarni, B., Kulkami-Kale, U. and Kolaskar, A.S. (1993) Multiple alignment of sequences on parallel computers. Comput. Applic. Biosci., 9, 397-402.
15. Dongarra, J.J., Hempel, R., Hey, A.J.G. and Walker, D.W. (1993) A proposal for a user-level message passing interface (MPI) in a distributed memory environment. Technical Report TM-12231, Oak Ridge National Laboratory, Oak Ridge, TN.
16. Geman.S. and Geman.D. (1984) Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images. IEEE Trans. Pattern Analysis Machine Intelligence, 6, 721-741.
17. Greening, D.R. (1990) Parallel simulated annealing techniques. Physica D, 42, 293-306.
18. Hord, R.M. (1990) Parallel Supercomputing in SIMD Architectures. CRC Press, Boca Raton, FL.
19. Huang.X., Miller.W., Schwartz, S. and Hardison.R.C. (1992) Parallel-ization of a local similarity search algorithm. Comput. Applic. Biosci., 8, 155-166.
20. Intel iPSC/860 Concurrent Programming User Guide. 1992. Intel Corp., Beaverton, OR.
21. Intel iPSC/860 C Commands and Routines: Reference Guide. 1992. Intel Corp., Bcaverton, OR.
22. Ishikawa, M., Toya, T., Hoshida, M., Nitta, K., Ogiwara, A. and Kanehisa, M. (1993) Multiple Sequence Alignment by Parallel Simulated Annealing. Comput. Applic. Biosci., 9, 267—273.
23. Jayaraman, R. and Rutenbar.R. (1987) Floor planning by annealing on a hypercube multiprocessor. In Proceedings of the IEEE International Conference on Computer Aided Design, IEEE Press, New York, pp. 346-349.
24. Jones, R. (1992) Sequence pattern matching on a massively parallel computer. Comput. Applic. Biosci., 8, 377-384.
25. Kirkpatrick.S., Gelatt, C. Jr and Vecchiet.M. (1983) Optimization by simulated annealing. Science, 220, 498-516.
26. Lee, F.H., Stiles, G.S. and Swaminathan.V. (1994) Parallel Annealing on Distributed Memory Systems. Technical Report, Department of Electrical and Computer Engineering, Utah State University, Logan, UT.
27. Liuni.S., Prunella.N., Pesole.G., D'Orazio.T., Stella, E. and Distante.A. (1993) SIMD parallelization of the WORDUP algorithm for detecting statistically significant patterns in DNA sequences. Comput. Applic. Biosci., 9, 701-708.
28. MasPar Parallel Applications Language (MPL). User Guide. 1993. MasPar Computer Corp., Sunnyvale, CA.
29. MasPar Parallel Applications Language (MPL), Reference Guide. 1993. MasPar Computer Corp., Sunnyvale, CA.
30. Miller.P.L., Nadkarni, P.M. and Pearson.W.R. (1992a) Comparing machine-independent versus machine-specific parallelization of a software platform for biological sequence comparison. Compul. Applic. Biosci., 8, 167-175.
31. Miller.P L., Nadkarni.P.M. and Bercovitz, P.E. (1992b) Harnessing networked workstations as a powerful parallel computer: a general paradigm illustrated using three programs for genetic linkage analysis. Compul. Applic. Biosci., 8, 141-147.
32. Pease.M.C. (1977) The Indirect Binary n-cube Microprocessor Array. IEEE Trans. Compul., 25, 458-473.
33. Romeo.F. and Sangiovanni-Vincentelli.A. (1991) A theoretical framework for simulated annealing. Algohthmica, 6, 302-345.
34. Sunderam.V. (1990) PVM: a framework for parallel distributed computing. Concurrency. Practice Experience, 2, 315-339.
35. Wang, Y., Prade.R.A., Griffith, J., Timberlake, W.E. and Arnold.J. (1994a) A fast random cost algorithm for physical mapping. Proc. Satl Acad. Sci. USA, 91, 11094-11098.
36. Wang, Y., Prade, R.A., Griffith, J., Timberlake, W.E. and Arnold, J. (1994b) ODS_BOOTSTRAP: assessing the statistical reliability of physical maps by bootstrap resampling. Compul. Applic. Biosci., 10, 625-634.
37. Witte.E.E., Chamberlain.R.D. and Franklin, M.A. (1991) Parallel simulated annealing using speculative computation. IEEE Trans. Parallel Distrib. Sysl., 2, 483-494.
38. Wong.C.P. and Fiebrich.R.D. (1987) Simulated annealing-based circuit placement on the connection machine system. In Proceedings of IEEE International Conference on Computer Design, IEEE Press, New York, pp. 78-82.
39. Xiong, M., Chen, H.J., Prade, R.A., Wang, Y., Timberlake, W.E. and Arnold, J. (19%) On the consistency of a physical mapping method to reconstruct a chromosome in vitro. Genetics, 142, 267-284.