{"id":"https://openalex.org/W2351785945","doi":null,"title":"Some Parallel Approximation Algorithms for Multiple Sequence Alignment Problem","display_name":"Some Parallel Approximation Algorithms for Multiple Sequence Alignment Problem","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2351785945","mag":"2351785945"},"language":"en","primary_location":{"id":"mag:2351785945","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-ZKJD200505013.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"JUSTC","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Song Bin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Song Bin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100668039","display_name":"Guoliang Chen","orcid":"https://orcid.org/0000-0001-8031-6790","observed_orcids":["https://orcid.org/0000-0001-8031-6790"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guoliang Chen","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8031-6790","affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Yan Chao","orcid":"https://orcid.org/0000-0002-9957-2177","observed_orcids":["https://orcid.org/0000-0002-9957-2177"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan Chao","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9957-2177","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042236234","display_name":"Yi-Fei SHEN","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi-Fei SHEN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7792999744415283,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7792999744415283,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.1307000070810318,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.0471000000834465,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiple-sequence-alignment","display_name":"multiple sequence alignment","score":1.0},{"id":"https://openalex.org/keywords/parallel-approximation-algorithms","display_name":"parallel approximation algorithms","score":0.8629999756813049},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.9200000166893005},{"id":"https://openalex.org/keywords/linear-speedup","display_name":"linear speedup","score":0.75}],"concepts":[{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.699489176273346},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6690202951431274},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6548453569412231},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6086329221725464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5730574131011963},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.5642893314361572},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5475170016288757},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5200855135917664},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5016646385192871},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.4535183012485504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31913942098617554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3142716586589813},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2351785945","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-ZKJD200505013.htm","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"JUSTC","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2086931573","https://openalex.org/W2139600799","https://openalex.org/W4286560678","https://openalex.org/W2079682109","https://openalex.org/W182898593","https://openalex.org/W2164762093","https://openalex.org/W2104383381","https://openalex.org/W2244344606","https://openalex.org/W1555529056","https://openalex.org/W2021865450"],"abstract_inverted_index":{"Based":[0],"on":[1,15,127,204],"the":[2,9,35,40,43,65,78,109,114,137,143,148,153,173,177,198],"idea":[3],"of":[4,30,37,42,87,139,145,176,186],"center":[5,67],"star":[6,68],"method":[7,69],"and":[8,60,97,142,151,159,188,214],"divide-and-conquer":[10],"strategy,A":[11],"parallel":[12,80,118,146,154],"approximation":[13,119],"algorithm":[14,23,106,120,207],"SIMD-CREW":[16,205],"model":[17,141],"is":[18,34,39,47,61,74,121,172,184,194,203,229],"presented":[19,105],"to":[20,93,191],"solve":[21,108],"it.The":[22],"needs":[24],"O(m+log":[25,164,200],"k)":[26,201],"time":[27,103,167,216],"in":[28,58,72,111,163,211,224],"use":[29],"O(k~(2)m)":[31,169],"processors,where":[32,170],"k":[33,187],"number":[36],"sequences,m":[38],"length":[41],"longest":[44],"sequence.In":[45],"fact,logk":[46],"much":[48,62,195,230],"less":[49,231],"than":[50,64,77,197,232],"m,":[51],"so":[52],"it":[53,193],"obtains":[54,220],"a":[55,131,221],"linear":[56,128,222],"speedup":[57,223],"theory":[59],"faster":[63],"sequential":[66],"which":[70],"runs":[71,162],"O(m~(2)k~(2)).It":[73],"more":[75],"efficient":[76],"existing":[79,88],"algorithms":[81,155],"for":[82,123,156],"multiple":[83,124],"sequence":[84,125,180],"alignment,for":[85],"some":[86,94,98],"ones":[89],"have":[90,99],"been":[91],"applied":[92,210],"special":[95],"situations":[96],"had":[100],"trouble":[101],"analyzing":[102,215],"complexities.The":[104],"can":[107,208],"problem":[110],"any":[112,212],"situation.On":[113],"other":[115],"hand,the":[116],"first":[117],"given":[122],"alignment":[126],"arrays":[129],"with":[130,218],"reconfigurable":[132],"pipelined":[133],"bus":[134],"system(LARPBS)model":[135],"using":[136],"properties":[138],"LARPBS":[140],"technique":[144],"computing":[147,157],"prefix":[149],"sums":[150,158],"applying":[152],"maximum(minimum)on":[160],"LARPBS.It":[161],"log":[165,182,226,227],"D)":[166,183],"by":[168],"D":[171,228],"highest":[174],"cost":[175],"optimal":[178],"pairwise":[179],"alignments.Especially,O(m+log":[181],"independent":[185],"related":[189],"only":[190],"m.Then":[192],"better":[196],"former":[199],"that":[202],"model.Also,the":[206],"be":[209],"situation":[213],"complexity":[217],"ease.It":[219],"theory,for":[225],"m.":[233]},"counts_by_year":[],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}