Abstract: Huge collection of documents is available at few mouse clicks. The current World Wide Web is a web of pages. Users have to guess possible keywords that might lead through search engines to the pages that contain information of interest and browse hundreds or even thousands of the returned pages in order to obtain what they want. In our work we build a generalized suffix tree for our documents and propose a search technique for retrieving documents based on a sort of phrase called word sequences. Our proposed method efficiently searches for a given phrase (with missing or additional words in between) with better performance.

N Sandhya, A. Govardhan, Y. Sri Lalitha and K. Anuradha, “An improved Approach for Document Retrieval Using Suffix Trees” International Journal of Advanced Computer Science and Applications(IJACSA), 2(9), 2011. http://dx.doi.org/10.14569/IJACSA.2011.020906

@article{Sandhya2011,
title = {An improved Approach for Document Retrieval Using Suffix Trees},
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2011.020906},
url = {http://dx.doi.org/10.14569/IJACSA.2011.020906},
year = {2011},
publisher = {The Science and Information Organization},
volume = {2},
number = {9},
author = {N Sandhya and A. Govardhan and Y. Sri Lalitha and K. Anuradha},
}