Author image not provided
 Adam Cannane

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article7.57
Citation Count53
Publication count7
Publication years1999-2004
Available for download4
Average downloads per article626.00
Downloads (cumulative)2,504
Downloads (12 Months)27
Downloads (6 Weeks)2
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

July 2004 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 1 Issue 3, July 2004
Publisher: IEEE Computer Society Press
Citation Count: 12
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 795

Full text available: PDFPDF
Homology search is a key tool for understanding the role, structure, and biochemical function of genomic sequences. The most popular technique for rapid homology search is blast, which has been in widespread use within universities, research centers, and commercial enterprises since the early 1990s. In this paper, we propose a ...
Keywords: Index Terms- Sequence alignment, BLAST, dynamic programming, homology search.

January 2004 ACSC '04: Proceedings of the 27th Australasian conference on Computer science - Volume 26
Publisher: Australian Computer Society, Inc.
Citation Count: 18
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 415

Full text available: PDFPDF
Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all practical search engines is supported by an inverted index structure that stores all search terms and their locations ...
Keywords: efficiency, information retrieval, inverted indexes, Web search engines

February 2003 ACSC '03: Proceedings of the 26th Australasian computer science conference - Volume 16
Publisher: Australian Computer Society, Inc.
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 228

Full text available: PDFPDF
Automatic categorisation is an important technique for the management of large document collections. Categorisation can be used to store or locate documents that satisfy an information need when the need cannot be expressed as a concise list of query terms. Inverted indexes are used in all query-based retrieval systems to ...
Keywords: categorisation, compression, inverted indexing, efficiency, document management

4 published by ACM
July 2002 ACM Transactions on Information Systems (TOIS): Volume 20 Issue 3, July 2002
Publisher: ACM
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 1,066

Full text available: PDFPDF
Compression of large collections can lead to improvements in retrieval times by offsetting the CPU decompression costs with the cost of seeking and retrieving data from disk. We propose a semistatic phrase-based approach called xray that builds a model offline using sample training data extracted from a collection, and then ...
Keywords: sampling, phrase-based compression, random access

March 2001 Journal of the American Society for Information Science and Technology: Volume 52 Issue 5, March 2001
Publisher: John Wiley & Sons, Inc.
Citation Count: 8

January 2000 ADC '00: Proceedings of the Australasian Database Conference
Publisher: IEEE Computer Society
Citation Count: 3

Compression of databases not only reduces space requirements but can also reduce overall retrieval times. We have described elsewhere our RAY algorithm for compressing databases containing general-purpose data, such as images, sound, and also text. We describe here an extension to the RAY compression algorithm that permits use on very ...
Keywords: database compression, semi-static modeling, phrase-based compression

March 1999 DCC '99: Proceedings of the Conference on Data Compression
Publisher: IEEE Computer Society
Citation Count: 2

We describe a new variant of the semi-static sequitur algorithm, ray , that reduces main-memory use and allows random-access to databases. Ray models repetition in sequences by progressively constructing a hierarchical grammar with multiple passes through the data. The multiple pass approach of ray uses statistics on character pair repetition, ...

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us