
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A.S. LaPaugh, R.J. Lipton, J.S. Sandberg, "How to Store a Triangular Matrix," IEEE Transactions on Computers, vol. 41, no. 7, pp. 896899, July, 1992.  
BibTex  x  
@article{ 10.1109/12.256446, author = {A.S. LaPaugh and R.J. Lipton and J.S. Sandberg}, title = {How to Store a Triangular Matrix}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {7}, issn = {00189340}, year = {1992}, pages = {896899}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.256446}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  How to Store a Triangular Matrix IS  7 SN  00189340 SP896 EP899 EPD  896899 A1  A.S. LaPaugh, A1  R.J. Lipton, A1  J.S. Sandberg, PY  1992 KW  triangular matrix; vector; arithmetic progression; data structures; file organisation. VL  41 JA  IEEE Transactions on Computers ER   
The problem of storing a triangular matrix so that each row and column is stored as a vector, i.e. the locations form an arithmetic progression, is discussed. Storing rows and columns as vectors can speed up access significantly. It is shown that there is no such storage method that does not waste approximately onehalf of the computer memory.
[1] P. Budnick and D. J. Kuck, "The organization and use of parallel memories,"IEEE Trans. Comput., vol. C20, pp. 15661569, Dec. 1971.
[2] H. GarciaMolina, R. Lipton, and J. Valdes, "A massive memory machine,"IEEE Trans. Comput., vol. C33, pp. 391399, May 1984.
[3] G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers. London, UK Oxford University Press, 1975.
[4] A. B. Jacobson, L. Good, J. Simonetti, and M. Zucker, "Some simple computational methods to improve the folding of large RNA's,"Nucleic Acids Res., vol. 12, no. 1, pp. 4552, 1984.
[5] M. Kanehisa and C. DeLisi, "The prediction of a protein and nucleic acid structure: Problems and prospects,"Acta Applicande Machematicae, no. 4, pp. 115137, 1985.
[6] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: AddisonWesley, 1973.
[7] D. H. Lawrie, "The prime memory system for array access,"IEEE Trans. Comput., vol. C31, pp. 134141, 1982.
[8] R. Nussinov, G. Pieczenik, J. R. Griggs, and D. J. Kleitman, "Algorithms for looping matching,"SIAM J. Appl. Math., vol. 35, no. 1, pp. 6882, 1978.
[9] D. Sankoff, J. B. Kruskal, S. Mainville, and R. J. Cedergren, "Fast algorithms to determine RNA secondary structures containing multiple loops," inTime Wraps, String Edits, and Macromolecules: Theory and Practice of Sequence Comparisons, D. Sankoff and J. B. Kruskal Eds. Reading, MA: AddisonWesley, 1983, pp. 93120.
[10] M. Zucker and P. Stiegler, "Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information,"Nucleic Acids Res., vol. 9, no. 1, pp. 133148, 1981.