Analyzing the Performance Differences Between Pattern Matching and Compressed Pattern Matching on Texts

Basit Öğe Kaydı
dc.authorid0000-0001-5495-7754
dc.authorwosidErdoğan, Cihat/E-4681-2019
dc.authorwosidBuluş, Halil Nusret/ABA-8815-2020
dc.contributor.authorErdoğan, Cihat
dc.contributor.authorBuluş, Halil Nusret
dc.contributor.authorDiri, Banu
dc.date.accessioned2022-05-11T14:15:47Z
dc.date.available2022-05-11T14:15:47Z
dc.date.issued2013
dc.departmentFakülteler, Çorlu Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü
dc.description10th International Conference on Electronics, Computer and Computation (ICECCO) -- NOV 07-09, 2013 -- Turgut Ozal Univ, Ankara, TURKEY
dc.description.abstractIn this study the statistics of pattern matching on text data and the statistics of compressed pattern matching on compressed form of the same text data are compared. A new application has been developed to count the character matching numbers in compressed and uncompressed texts individually. Also a new text compression algorithm that allows compressed pattern matching by using classical pattern matching algorithms without any change is presented in this paper. In this paper while the presented compression algorithm based on digram and trigram substitution has been giving about 30-35% compression factor, the duration of compressed pattern matching on compressed text is calculated less than the duration of pattern matching on uncompressed text. Also it is confirmed that the number of character comparison on compressed texts while doing a compressed pattern matching is less than the number of character comparison on uncompressed texts. Thus the aim of the developed compression algorithm is to point out the difference in text processing between compressed and uncompressed text and to form opinions for another applications.
dc.description.sponsorshipInst Elect & Elect Engineers
dc.identifier.endpage138
dc.identifier.isbn978-1-4799-3343-3
dc.identifier.scopus2-s2.0-84894190784
dc.identifier.startpage135
dc.identifier.urihttps://hdl.handle.net/20.500.11776/6071
dc.identifier.wosWOS:000336616500035
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorErdoğan, Cihat
dc.institutionauthorBuluş, Halil Nusret
dc.language.isoen
dc.publisherIEEE
dc.relation.ispartof2013 International Conference on Electronics, Computer and Computation (Icecco)
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectData compression
dc.subjectPattern matching
dc.subjectCompressed Pattern Matching
dc.subjectPattern Substitution
dc.titleAnalyzing the Performance Differences Between Pattern Matching and Compressed Pattern Matching on Texts
dc.typeConference Object

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
6071.pdf
Boyut:
265.89 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
Çorlu Mühendislik Fakültesi Koleksiyonu