메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject

Parallel Algorithms for Finding δ-approximate Periods and γ-approximate Periods of Strings over Integer Alphabets
Recommendations
Search
Questions

정수문자열의 δ-근사주기와 γ-근사주기를 찾는 병렬알고리즘

논문 기본 정보

Type
Academic journal
Author
Youngho Kim (인하대학교) Jeong Seop Sim (인하대학교)
Journal
Korean Institute of Information Scientists and Engineers Journal of KIISE Vol.44 No.8 KCI Excellent Accredited Journal
Published
2017.8
Pages
760 - 766 (7page)
DOI
10.5626/JOK.2017.44.8.760

Usage

cover
📌
Topic
📖
Background
🔬
Method
🏆
Result
Parallel Algorithms for Finding δ-approximate Periods and γ-approximate Periods of Strings over Integer Alphabets
Ask AI
Recommendations
Search
Questions

Abstract· Keywords

Report Errors
Repetitive strings have been studied in diverse fields such as data compression, bioinformatics and so on. Recently, two problems of approximate periods of strings over integer alphabets were introduced, finding minimum δ-approximate periods and finding minimum γ-approximate periods. Both problems can be solved in O(n²) time when n is the length of the string. In this paper, we present two parallel algorithms for solving the above two problems in O(n²) time using O(n²) threads, respectively. The experimental results show that our parallel algorithms for finding minimum δ-approximate (resp. γ-approximate) periods run approximately 19.7 (resp. 40.08) times faster than the sequential algorithms when n = 10,000.

Contents

요약
Abstract
1. 서론
2. 관련 연구
3. 최소 δ-근사주기와 최소 γ-근사주기 병렬 계산 알고리즘
4. 실험 결과
5. 결론
References

References (13)

Add References

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Frequently Viewed Together

Recently viewed articles

Comments(0)

0

Write first comments.