کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
468740 | 698251 | 2011 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A logarithmic time complexity algorithm for pattern searching using product–sum property
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A logarithmic time complexity algorithm for pattern searching using product–sum property A logarithmic time complexity algorithm for pattern searching using product–sum property](/preview/png/468740.png)
چکیده انگلیسی
Product–sum property states that an ordered pair (sn,pn)(sn,pn) is unique for any ordered set a1,a2,…,ana1,a2,…,an where ai,n∈N, and snsn and pnpn are the sum and product of the elements of the set, respectively. This fact has been exploited to develop an O(log(M))O(log(M)) time complexity algorithm for pattern searching in a large dataset, where MM is the number of records in the dataset. Two potential applications (from databases and computational biology) of this property have been demonstrated to show the effectiveness and working of the proposed algorithm. The space complexity of the algorithm rises to the quadratic order.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 62, Issue 5, September 2011, Pages 2162–2168
Journal: Computers & Mathematics with Applications - Volume 62, Issue 5, September 2011, Pages 2162–2168
نویسندگان
Khalid Mahmood Aamir, Mujahid Abbas, Stojan Radenović,