{"id":"https://openalex.org/W2797388202","doi":"https://doi.org/10.1007/s10878-008-9139-z","title":"A Lagrangian relaxation approach for the multiple sequence alignment problem","display_name":"A Lagrangian relaxation approach for the multiple sequence alignment problem","publication_year":2008,"publication_date":"2008-03-04","ids":{"openalex":"https://openalex.org/W2797388202","doi":"https://doi.org/10.1007/s10878-008-9139-z","mag":"2797388202"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-008-9139-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-008-9139-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9139-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9139-z.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042086373","display_name":"Ernst Althaus","orcid":"https://orcid.org/0000-0002-2122-9520"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ernst Althaus","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Campus E14, 66123, Saarbr\u00fccken, Germany","Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Campus E14, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055704933","display_name":"Stefan Canzar","orcid":"https://orcid.org/0000-0003-4719-8010"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Canzar","raw_affiliation_strings":["Max-Planck Institut f\u00fcr Informatik, Campus E14, 66123, Saarbr\u00fccken, Germany","Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Campus E14, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055704933"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.2602,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.5975397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"16","issue":"2","first_page":"127","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9991999864578247,"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.9991999864578247,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9945999979972839,"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/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9850000143051147,"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/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.9403218030929565},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.651104211807251},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6502466797828674},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6167485117912292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5832313895225525},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.575215220451355},{"id":"https://openalex.org/keywords/lagrangian","display_name":"Lagrangian","score":0.5675958395004272},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5302481651306152},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.5298196077346802},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5206860303878784},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5190247297286987},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49735406041145325},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.46876877546310425},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34903571009635925},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.277823805809021},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06436797976493835}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.9403218030929565},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.651104211807251},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6502466797828674},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6167485117912292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5832313895225525},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.575215220451355},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.5675958395004272},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5302481651306152},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.5298196077346802},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5206860303878784},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5190247297286987},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49735406041145325},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.46876877546310425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34903571009635925},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.277823805809021},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06436797976493835},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-008-9139-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-008-9139-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9139-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:16:y:2008:i:2:d:10.1007_s10878-008-9139-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-008-9139-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:edoc.mpg.de:427966","is_oa":false,"landing_page_url":"http://edoc.mpg.de/427966","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, v.16, 127-154 (2008)","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s10878-008-9139-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-008-9139-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-008-9139-z.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2797388202.pdf","grobid_xml":"https://content.openalex.org/works/W2797388202.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1485262373","https://openalex.org/W1501400124","https://openalex.org/W1559215823","https://openalex.org/W1598076371","https://openalex.org/W1694876563","https://openalex.org/W1974326986","https://openalex.org/W1990061958","https://openalex.org/W1998139877","https://openalex.org/W2011039300","https://openalex.org/W2015784096","https://openalex.org/W2030701413","https://openalex.org/W2047923658","https://openalex.org/W2058748455","https://openalex.org/W2081843224","https://openalex.org/W2082378428","https://openalex.org/W2093190980","https://openalex.org/W2095581275","https://openalex.org/W2099813847","https://openalex.org/W2102502076","https://openalex.org/W2106882534","https://openalex.org/W2114844199","https://openalex.org/W2125372717","https://openalex.org/W2132926880","https://openalex.org/W2135434753","https://openalex.org/W2144362290","https://openalex.org/W2152331922","https://openalex.org/W2154400062","https://openalex.org/W2911835594","https://openalex.org/W4210777595","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2360271985","https://openalex.org/W2131718214","https://openalex.org/W3149469165","https://openalex.org/W2002987466","https://openalex.org/W2146044547","https://openalex.org/W2070276483","https://openalex.org/W4313484281","https://openalex.org/W1972437117","https://openalex.org/W1973889396","https://openalex.org/W2467306310"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,32,50,60,66],"branch-and-bound":[3],"(bb)":[4],"algorithm":[5],"for":[6,41,106],"the":[7,15,46,77,83,90,107,113,116,120],"multiple":[8,108],"sequence":[9,109],"alignment":[10,52,110],"problem":[11,92],"(MSA),":[12],"one":[13],"of":[14,35,115],"most":[16],"important":[17],"problems":[18],"in":[19],"computational":[20],"biology.":[21],"The":[22],"upper":[23],"bound":[24],"at":[25,82],"each":[26],"bb":[27],"node":[28],"is":[29,118],"based":[30],"on":[31],"Lagrangian":[33,47,91],"relaxation":[34,74],"an":[36],"integer":[37],"linear":[38],"programming":[39,62],"formulation":[40],"MSA.":[42],"Dualizing":[43],"certain":[44],"inequalities,":[45],"subproblem":[48],"becomes":[49],"pairwise":[51],"problem,":[53],"which":[54],"can":[55],"be":[56],"solved":[57],"efficiently":[58],"by":[59],"dynamic":[61],"approach.":[63],"Due":[64],"to":[65,73,88],"reformulation":[67],"w.r.t.":[68],"additionally":[69],"introduced":[70],"variables":[71],"prior":[72],"we":[75],"improve":[76],"convergence":[78],"rate":[79],"dramatically":[80],"while":[81],"same":[84],"time":[85],"being":[86],"able":[87],"solve":[89],"efficiently.":[93],"Our":[94],"experiments":[95],"show":[96],"that":[97],"our":[98],"implementation,":[99],"although":[100],"preliminary,":[101],"outperforms":[102],"all":[103],"exact":[104],"algorithms":[105],"problem.":[111],"Furthermore,":[112],"quality":[114],"alignments":[117],"among":[119],"best":[121],"computed":[122],"so":[123],"far.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}