CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

IPNWPSR: Iterated Partial Neighbor Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm

by Arash Ghorbannia Delavar, Elahe Moghimi Hanjani, Vahe Aghazarian
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 1
Year of Publication: 2012
Authors: Arash Ghorbannia Delavar, Elahe Moghimi Hanjani, Vahe Aghazarian
10.5120/8163-1377

Arash Ghorbannia Delavar, Elahe Moghimi Hanjani, Vahe Aghazarian . IPNWPSR: Iterated Partial Neighbor Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm. International Journal of Computer Applications. 52, 1 ( August 2012), 1-8. DOI=10.5120/8163-1377

@article{ 10.5120/8163-1377,
author = { Arash Ghorbannia Delavar, Elahe Moghimi Hanjani, Vahe Aghazarian },
title = { IPNWPSR: Iterated Partial Neighbor Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 1 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number1/8163-1377/ },
doi = { 10.5120/8163-1377 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:51:09.609391+05:30
%A Arash Ghorbannia Delavar
%A Elahe Moghimi Hanjani
%A Vahe Aghazarian
%T IPNWPSR: Iterated Partial Neighbor Word Plane Sweep Replicated, Evolution of Searching in Partial Tandem Replicated Sequence on Plane Sweep Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 1
%P 1-8
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper describes a method to optimize the plane sweep algorithm. The goal of this paper is to develop a method that reduces the comparison through removing the tandem replicated word comparison and also using partial search technique in a document for escaping from the keywords that are ineffective. The approach introduces Plane Sweep algorithm that is the base algorithm used to search for keywords. Reducing the search area, change the number of keyword's comparisons in a document and speed up our search algorithm. So searching operation is done in a smaller space and we don't need to search all the keywords in a document. In this algorithm, we make a new technique to create the algorithm that detect the number of tandem replicated words in a document and also searching on a target part, thus reducing the number of keywords in a document speed up our search algorithm. In proposed algorithm time complexity with lower order has been created than the basic algorithm. Searching for results occurs in a reduced space and it has led to a better performance without comparing all the keywords in the list. The algorithm is robust, and highly effective especially in a high volume of data.

References
  1. Arash Ghorbannia Delavar, Elahe Moghimi Hanjani, WPSR: Word Plane Sweep Replicated, Present a Plane sweep Algorithm to optimize the use of Replicated data in a document, International Journal of Computer Science Issues, Vol. 9, Issue 2, No 3, 2012.
  2. Alan Feuer, Stefan Savev, Javed A. Aslam, "Implementing and evaluating phrasal query suggestions for proximity search", Elsevier, College of Computer and Information Science, 2009.
  3. Feuer Alan, Savev Stefan, Javed A. Aslam, Evaluation Of phrasal query suggestions, in: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management (CIKM '07), Lisboa, Portugal, 2007.
  4. K. Sadakane, H. Imai, Fast algorithms for k-word proximity search, IEICE Trans. Fundamentals E84-A (9) (September 2001) 312–319.
  5. Chirag Gupta, Gultekin Özsoyoglu, Z. Meral Özsoyoglu. Efficient k-word proximity search. In The 24th International Symposium on Computer and Information Sciences, ISCIS 2009, 14-16 September 2009, North Cyprus. pages 123-128, IEEE, 2009.
  6. Zobel J. ,Moffat A. ,Inverted files for text Search Engines,ACM computing surveys(C SUR),v382,2006.
  7. B. J. Jansen, A. Spink, T. Saracevic, Real life, real users, and real needs: a study and analysis of user queries on the web, Inf. Process. Manage. 36 (2) (2000) 207–27.
  8. S. Kim,I. Lee,K. Park,A fast algorithm for the generalized k-keyword proximity problem given keyword offsets , Inf. Process. Lett. 91(3)(2004)115–120.
  9. S. Lawrence, C. L. Giles, Searching the web: general and scientific information access, IEEE Communications 37 (1) (1999) 116–122.
  10. Atheer A. Matroud1, M. D. Hendy and C. P. (2011) Tuffley NTRFinder: a software tool to find nested tandem repeats.
  11. R. Uricaru, A. Mancheron, E. Rivals, Novel definition and algorithm for chaining fragments with proportional overlaps, J. of Computational Biology, Vol. 18(9), p. 1141-54, 2011.
  12. E. Adebiyi, E. Rivals, Detection of Recombination in Variable Number Tandem Repeat Sequences, South African Computer Journal (SACJ), 39, p. 1–7, 2007.
  13. E. Rivals, A Survey on Algorithmic Aspects of Tandem Repeat Evolution, International Journal on Foundations of Computer Science, Vol. 15, No. 2, p. 225-257, 2004.
  14. Atheer A. Matroud , Michael D. Hendy , Christopher P. Tuffley ,An algorithm to solve the motif alignment Problem for approximate nested tandem repeats, RECOMB-CG'10 Proceedings of the international conference on Comparative genomics, 2010.
  15. Hongxia Zhou, Liping Du, Hong Yan, Detection of tandem repeats in DNA sequences based on parametric spectral estimation. IEEE transactions on information echnology in biomedicine a publication of the IEEE Engineering in Medicine and Biology Society (2009).
  16. G M Landau, J P Schmidt, D Sokol, An algorithm for approximate tandem repeats. Journal of computational biology a journal of computational molecular cell biology, (2001).
  17. Rasolofo Yves, Savoy Jacques, Term proximity scoring for keyword-based retrieval systems, 25th European Conference on IR research, ECIR 2003.
  18. Hao Yan, Shuming Shi, Fan Zhang, Torsten Suel, Ji-rong Wen, Efficient Term Proximity Search with Term-Pair Indexes, the 19th ACM conference on Conference on information and knowledge management CIKM 10 (2010).
  19. Ralf Schenkel, Andreas Broschart, Seungwon Hwang, Martin Theobald, Gerhard Weikum, Efficient Text Proximity Search, String Processing and Informatio Retrieval (2007).
  20. Navarro, G. and Salmela, L. 2009. Indexing variable length substrings for exact and approximate matching. In Proceedings of the 16th International Symposium on String Processing and Information Retrieval (SPIRE'09). Springer, Berlin, 214--221.
  21. Inbok Lee, Sung-Ryul Kim: An Algorithm for the Generalized k-Keyword Proximity Problem and Finding Longest Repetitive Substring in a Set of Strings. International Conference on Computational Science (4) 2006: 289-292,2006.
  22. Taehyung Lee, Sung-Ryul Kim, Kunsoo Park: Approximate Word Sequence Matching on an Inverted File Index. IWOCA 2008: 100-114,2008.
  23. J. Zobel and A. Moffat. Inverted files for text search engines. ACM Computing Surveys, 38(2), 2006.
  24. Hao Yan, Shuming Shi, Fan Zhang, Torsten Suel, Ji-rong Wen, Efficient Term Proximity Search with Term-Pair Indexes, the 19th ACM conference on Conference on information and knowledge management CIKM 10 (2010).
Index Terms

Computer Science
Information Sciences

Keywords

Plane sweep algorithm Replicated data String matching Optimized algorithm partial search Text retrieval Proximity search

Powered by PhDFocusTM