Definition: A term from combinatorial chemistry referring to trying all possible combinations of blocks. This is not a data structure, and is here to reduce confusion.
Dimitris K. Agrafiotis, Multiobjective Optimization of Combinatorial Libraries, IBM Journal of Research and Development, Yorktown Heights, New York, USA, 45(3/4):545-566, May/July 2001. Referenced on page 548.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon Nov 18 10:44:09 2013.
Cite this as:
Paul E. Black, "full array", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/fullArray.html