{"repository":{"description":"This is a parallel programming Implementation of the famous global alignment problem which runs in O(n) Time as Compared to is Serial Counterpart which O(n^2) in complexity ","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":116,"owner":"nileshkulkarni","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-11-14T06:17:17-08:00","pushed_at":"2013-11-14T06:20:50-08:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/nileshkulkarni/Seq_Alignment_GPUS"}