{"id":"https://openalex.org/W2098974344","doi":"https://doi.org/10.1109/ipdps.2003.1213295","title":"Solving the protein threading problem in parallel","display_name":"Solving the protein threading problem in parallel","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2098974344","doi":"https://doi.org/10.1109/ipdps.2003.1213295","mag":"2098974344"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2003.1213295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"article","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/A5111777256","display_name":"Nicola Yanev","orcid":"https://orcid.org/0000-0003-4130-8813"},"institutions":[{"id":"https://openalex.org/I58918642","display_name":"Sofia University \"St. Kliment Ohridski\"","ror":"https://ror.org/02jv3k292","country_code":"BG","type":"education","lineage":["https://openalex.org/I58918642"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"N. Yanev","raw_affiliation_strings":["University of Sofia, Sofia, Bulgaria"],"affiliations":[{"raw_affiliation_string":"University of Sofia, Sofia, Bulgaria","institution_ids":["https://openalex.org/I58918642"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040381671","display_name":"Rumen Andonov","orcid":"https://orcid.org/0000-0003-4842-7102"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"R. Andonov","raw_affiliation_strings":["Campus de Beaulieu, IRISA, Rennes, France"],"affiliations":[{"raw_affiliation_string":"Campus de Beaulieu, IRISA, Rennes, France","institution_ids":["https://openalex.org/I2802519937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111777256"],"corresponding_institution_ids":["https://openalex.org/I58918642"],"apc_list":null,"apc_paid":null,"fwci":2.3438,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8591029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2000","issue":null,"first_page":"8","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11617","display_name":"Enzyme Production and Characterization","score":0.9646000266075134,"subfield":{"id":"https://openalex.org/subfields/1305","display_name":"Biotechnology"},"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/T11617","display_name":"Enzyme Production and Characterization","score":0.9646000266075134,"subfield":{"id":"https://openalex.org/subfields/1305","display_name":"Biotechnology"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9617000222206116,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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.902899980545044,"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.6646640300750732},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.641760528087616},{"id":"https://openalex.org/keywords/threading","display_name":"Threading (protein sequence)","score":0.6279382705688477},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6138967871665955},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4385956823825836},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4237546920776367},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4236859977245331},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4230874180793762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40109410881996155},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32056868076324463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.261288046836853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14969131350517273},{"id":"https://openalex.org/keywords/protein-structure","display_name":"Protein structure","score":0.10718441009521484}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6646640300750732},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.641760528087616},{"id":"https://openalex.org/C200307862","wikidata":"https://www.wikidata.org/wiki/Q7797175","display_name":"Threading (protein sequence)","level":3,"score":0.6279382705688477},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6138967871665955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4385956823825836},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4237546920776367},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4236859977245331},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4230874180793762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40109410881996155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32056868076324463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.261288046836853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14969131350517273},{"id":"https://openalex.org/C47701112","wikidata":"https://www.wikidata.org/wiki/Q735188","display_name":"Protein structure","level":2,"score":0.10718441009521484},{"id":"https://openalex.org/C46141821","wikidata":"https://www.wikidata.org/wiki/Q209402","display_name":"Nuclear magnetic resonance","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ipdps.2003.1213295","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2003.1213295","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Parallel and Distributed Processing Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.354","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.hicomb.org/HiCOMB2002/papers/HICOMB2003-11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","score":0.4300000071525574,"display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1497826146","https://openalex.org/W1548268345","https://openalex.org/W1554808127","https://openalex.org/W1589993665","https://openalex.org/W2022615940","https://openalex.org/W2041966417","https://openalex.org/W2051347734","https://openalex.org/W2059886402","https://openalex.org/W2063320403","https://openalex.org/W2093591760","https://openalex.org/W2133715954","https://openalex.org/W2254511056","https://openalex.org/W4238480142","https://openalex.org/W6635279599","https://openalex.org/W6691870711","https://openalex.org/W6819773262"],"related_works":["https://openalex.org/W1554180614","https://openalex.org/W4232948691","https://openalex.org/W2069834727","https://openalex.org/W4300126630","https://openalex.org/W2167671877","https://openalex.org/W2380523273","https://openalex.org/W2349503285","https://openalex.org/W2246807311","https://openalex.org/W2020139636","https://openalex.org/W1598935394"],"abstract_inverted_index":{"We":[0,88],"propose":[1],"a":[2,19,22,51,57,63,82,94,112],"network":[3],"flow":[4],"formulation":[5],"for":[6,38],"protein":[7,40],"threading":[8,41],"and":[9,66,96],"show":[10,89],"its":[11],"equivalence":[12],"with":[13,21,122],"the":[14,39,72,78,116],"shortest":[15],"path":[16],"problem":[17,42,80,124],"on":[18,81],"graph":[20],"very":[23,36],"particular":[24],"structure.":[25],"The":[26,69],"underlying":[27],"mixed":[28,58],"integer":[29,59],"programming":[30],"(MIP)":[31],"model":[32,74],"proves":[33],"to":[34,103,111],"be":[35,100],"appropriate":[37],"-":[43],"huge":[44,123],"real-life":[45],"instances":[46,125],"have":[47],"been":[48],"solved":[49],"in":[50,90,105,115],"reasonable":[52],"time":[53],"by":[54],"using":[55],"only":[56],"optimizer":[60],"instead":[61],"of":[62,71,77,85],"special-purpose":[64],"branch":[65,95],"bound":[67],"algorithm.":[68],"properties":[70],"MIP":[73],"allow":[75],"decomposition":[76],"main":[79],"large":[83],"number":[84],"subproblems":[86],"(tasks).":[87],"this":[91],"paper":[92],"that":[93],"bound-like":[97],"algorithm":[98],"can":[99],"efficiently":[101],"applied":[102],"solving":[104],"parallel":[106],"these":[107],"tasks,":[108],"which":[109],"leads":[110],"significant":[113],"reduction":[114],"total":[117],"running":[118],"time.":[119],"Computational":[120],"experiments":[121],"are":[126],"presented.":[127]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}