Osaka Prefecture University Repository >
A.Osaka Prefecuture University:(2005-) >
0300.School of Science/Graduate School of Science >
Doctoral Dissertation >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10466/14819

Title: An Efficient Implementation of the Longest Common Subsequence Algorithm with Bit-Parallelism on GPUs
Other Titles: ビット並列性を利用したGPU上の最長共通部分列導出アルゴリズムの効率的な実装
Authors: 河南, 克也
Issue Date: 2015
Description: 学位記番号:論理第117号, 指導教員:藤本 典幸
URI: http://hdl.handle.net/10466/14819
Academic Degrees and number: 24403甲第1574号
Degree-granting date: 2015-03-31
Degree name: 博士(理学)
Degree-granting institutions: Osaka Prefecture University (大阪府立大学)
Appears in Collections:Doctoral Dissertation
0300.Graduate School of Science

Files in This Item:

File Description SizeFormat
2014900133.pdf1.64 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.