• Türkçe
    • English
  • English 
    • Türkçe
    • English
  • Login
View Item 
  •   DSpace@Medipol
  • Araştırma Çıktıları | TR-Dizin | WoS | Scopus | PubMed
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
  •   DSpace@Medipol
  • Araştırma Çıktıları | TR-Dizin | WoS | Scopus | PubMed
  • Scopus İndeksli Yayınlar Koleksiyonu
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Fast and flexible packed string matching

Thumbnail

View/Open

Tam Metin / Full Text (401.6Kb)

Access

info:eu-repo/semantics/openAccess

Date

2014

Author

Faro, Simone
Külekci, Muhammed Oǧuzhan

Metadata

Show full item record

Citation

Faro, S. ve Külekci, M. O. (2014). Fast and flexible packed string matching. Journal of Discrete Algorithms, 28, 61-72. https://dx.doi.org/10.1016/j.jda.2014.07.003

Abstract

Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. In the last two decades a general trend has appeared trying to exploit the power of the word RAM model to speed-up the performances of classical string matching algorithms. In this model an algorithm operates on words of length w, grouping blocks of characters, and arithmetic and logic operations on the words take one unit of time. In this paper we use specialized word-size packed string matching instructions, based on the Intel streaming SIMD extensions (SSE) technology, to design a very fast string matching algorithm. We evaluate our solution in terms of efficiency, stability and flexibility, where we propose to use the deviation in running time of an algorithm on distinct equal length patterns as a measure of stability. From our experimental results it turns out that, despite their quadratic worst case time complexity, the new presented algorithm becomes the clear winner on the average in many cases, when compared against the most recent and effective algorithms known in literature.

xmlui.dri2xhtml.METS-1.0.item-scopusquality

Q3

Source

Journal of Discrete Algorithms

Volume

28

URI

https://hdl.handle.net/20.500.12511/1184
https://dx.doi.org/10.1016/j.jda.2014.07.003

Collections

  • Makale Koleksiyonu [69]
  • Scopus İndeksli Yayınlar Koleksiyonu [5812]
  • WoS İndeksli Yayınlar Koleksiyonu [5978]



DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 




| Guide | Contact |

DSpace@Medipol

by OpenAIRE
Advanced Search

sherpa/romeo

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsInstitution AuthorORCIDTitlesSubjectsTypeLanguageDepartmentCategoryWoS Q ValueScopus Q ValuePublisherAccess TypeThis CollectionBy Issue DateAuthorsInstitution AuthorORCIDTitlesSubjectsTypeLanguageDepartmentCategoryWoS Q ValueScopus Q ValuePublisherAccess Type

My Account

LoginRegister

Statistics

View Google Analytics Statistics

DSpace software copyright © 2002-2015  DuraSpace
Contact Us | Send Feedback
Theme by 
@mire NV
 

 


|| Guide || Library || İstanbul Medipol University || OAI-PMH ||

Kütüphane ve Dokümantasyon Daire Başkanlığı, İstabul, Turkey
If you find any errors in content, please contact: [email protected]

Creative Commons License
DSpace@Medipol by İstanbul Medipol University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..

DSpace@Medipol:


DSpace 6.2

tarafından İdeal DSpace hizmetleri çerçevesinde özelleştirilerek kurulmuştur.