Howard, Les2007-05-012007-05-011990-06LASIE 20(5-6) 1990:84-98http://hdl.handle.net/2440/27210The version uploaded has the last line of text on p.94 in the published version moved to the top of p.95.Call numbers traditionally used to implement shelf order in libraries are often amenable to machine sequencing, since they involve collating sequences which are sufficiently coherent for users and library staff to learn. However, these collating sequences usually do not match those implemented in computer systems, so that special programs to transform the call numbers into machine fileable sequences are necessary if the machines are to display the shelf order in a particular library. Two common machine collating sequences and their relations with some of the properties of Dewey/Cutter call numbers are briefly examined and a transformation procedure outlined.187454 bytesapplication/octet-streamenCall numbers; codepages; collating sequences; Dewey classification; Cutter numbers; online shelflist; shelflist order; Comaromi exampleJournal article20070430084431