{"id":"https://openalex.org/W2018245951","doi":"https://doi.org/10.1109/ipdpsw.2010.5470903","title":"A tile-based parallel Viterbi algorithm for biological sequence alignment on GPU with CUDA","display_name":"A tile-based parallel Viterbi algorithm for biological sequence alignment on GPU with CUDA","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W2018245951","doi":"https://doi.org/10.1109/ipdpsw.2010.5470903","mag":"2018245951"},"language":"en","primary_location":{"id":"doi:10.1109/ipdpsw.2010.5470903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdpsw.2010.5470903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100685313","display_name":"Zhihui Du","orcid":"https://orcid.org/0000-0002-8435-1611"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhihui Du","raw_affiliation_strings":["Tsinghua National Laboratory of Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing, China","Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua National Laboratory of Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035831616","display_name":"Zhaoming Yin","orcid":"https://orcid.org/0000-0002-9829-5382"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhaoming Yin","raw_affiliation_strings":["School of Software and Microelectronics, Peking University, China","School of Software and Microelectronics, Peking University, 100871, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Software and Microelectronics, Peking University, China","institution_ids":["https://openalex.org/I20231570"]},{"raw_affiliation_string":"School of Software and Microelectronics, Peking University, 100871, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076610730","display_name":"David A. Bader","orcid":"https://orcid.org/0000-0002-7380-5876"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Bader","raw_affiliation_strings":["College of Computing, Georgia Institute of Technology, Atlanta, GA, USA","College of Computing, Georgia Institute of Technology, Atlanta, 30332, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Computing, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"College of Computing, Georgia Institute of Technology, Atlanta, 30332, USA#TAB#","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12254","display_name":"Machine Learning in Bioinformatics","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8640509843826294},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.8441681861877441},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7086226940155029},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.6355025768280029},{"id":"https://openalex.org/keywords/kernel","display_name":"Kernel (algebra)","score":0.5950734615325928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.550574779510498},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.4926915764808655},{"id":"https://openalex.org/keywords/forward-algorithm","display_name":"Forward algorithm","score":0.4820602536201477},{"id":"https://openalex.org/keywords/hidden-markov-model","display_name":"Hidden Markov model","score":0.4436955153942108},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.421142578125},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.20881003141403198},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19756117463111877},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.18572169542312622},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.07991302013397217},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.07732051610946655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07396569848060608}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8640509843826294},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.8441681861877441},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7086226940155029},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.6355025768280029},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.5950734615325928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.550574779510498},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.4926915764808655},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.4820602536201477},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.4436955153942108},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.421142578125},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.20881003141403198},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19756117463111877},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.18572169542312622},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.07991302013397217},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.07732051610946655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07396569848060608},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdpsw.2010.5470903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdpsw.2010.5470903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.4467","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.4467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cc.gatech.edu/%7Ebader/papers/HMMGPU-HiCOMB2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.5899999737739563}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1574109141","https://openalex.org/W1598336441","https://openalex.org/W1767231739","https://openalex.org/W1881296051","https://openalex.org/W1969153299","https://openalex.org/W2009570821","https://openalex.org/W2011652244","https://openalex.org/W2032309817","https://openalex.org/W2057795393","https://openalex.org/W2087064593","https://openalex.org/W2097386339","https://openalex.org/W2108157916","https://openalex.org/W2116508956","https://openalex.org/W2122665495","https://openalex.org/W2125838338","https://openalex.org/W2127774996","https://openalex.org/W2128020796","https://openalex.org/W2136785928","https://openalex.org/W2153397025","https://openalex.org/W2164652663","https://openalex.org/W2169706611","https://openalex.org/W4245668478","https://openalex.org/W4246285230","https://openalex.org/W6634375705","https://openalex.org/W6664584004","https://openalex.org/W6682590169"],"related_works":["https://openalex.org/W2062804535","https://openalex.org/W2993094530","https://openalex.org/W2143297499","https://openalex.org/W2148710370","https://openalex.org/W2171280163","https://openalex.org/W2136652457","https://openalex.org/W3093520795","https://openalex.org/W2593596363","https://openalex.org/W2767243160","https://openalex.org/W1980772776"],"abstract_inverted_index":{"The":[0,44,186],"Viterbi":[1,144,181,195,229],"algorithm":[2,196,217],"is":[3,218],"the":[4,27,33,51,55,65,71,74,87,98,113,134,139,143,146,162,180,199,202,207,212,227],"compute-intensive":[5],"kernel":[6,141],"in":[7,133,171],"Hidden":[8],"Markov":[9],"Model":[10],"(HMM)":[11],"based":[12],"sequence":[13,209],"alignment":[14,210],"applications.":[15],"In":[16],"this":[17],"paper,":[18],"we":[19,102],"investigate":[20],"extending":[21],"several":[22],"parallel":[23,107,194],"methods,":[24],"such":[25],"as":[26],"wave-front":[28,45,200],"and":[29,93,124,157,201],"streaming":[30,75,203],"methods":[31],"for":[32,206],"Smith-Waterman":[34],"algorithm,":[35,145],"to":[36,86,116],"achieve":[37],"a":[38,42,104,168],"significant":[39],"speed-up":[40],"on":[41,100,184,219],"GPU.":[43,94,185],"method":[46,76],"can":[47,77,129,150,197],"take":[48,110],"advantage":[49,111],"of":[50,54,64,112,142,161,215],"computing":[52,148],"power":[53],"GPU":[56,67],"but":[57,81],"it":[58],"cannot":[59],"handle":[60],"long":[61,79,118,208],"sequences":[62,80,119],"because":[63],"physical":[66],"memory":[68],"limit.":[69],"On":[70],"other":[72],"hand,":[73],"process":[78],"with":[82,167],"increased":[83,88],"overhead":[84],"due":[85],"data":[89],"transmission":[90],"between":[91],"CPU":[92],"To":[95],"further":[96],"improve":[97],"performance":[99,183,214],"GPU,":[101],"propose":[103],"new":[105,192],"tile-based":[106,193,216],"algorithm.":[108,230],"We":[109],"homological":[114],"segments":[115],"divide":[117],"into":[120,153],"many":[121],"short":[122],"pieces":[123],"each":[125],"piece":[126],"pair":[127],"(tile)":[128],"be":[130,151],"fully":[131],"held":[132],"GPU's":[135],"memory.":[136],"By":[137],"reorganizing":[138],"computational":[140],"basic":[147],"unit":[149],"divided":[152],"two":[154],"parts:":[155],"independent":[156,163],"dependent":[158],"parts.":[159],"All":[160],"parts":[164],"are":[165],"executed":[166],"balanced":[169],"load":[170],"an":[172,222],"optimized":[173],"coalesced":[174],"memory-accessing":[175],"manner,":[176],"which":[177],"significantly":[178],"improves":[179],"algorithm's":[182],"experimental":[187],"results":[188],"show":[189],"that":[190],"our":[191],"outperform":[198],"methods.":[204],"Especially":[205],"problem,":[211],"best":[213],"average":[220],"about":[221],"order":[223],"magnitude":[224],"faster":[225],"than":[226],"serial":[228]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}