{"id":"https://openalex.org/W1489288704","doi":null,"title":"A space-efficient algorithm for the constrained pairwise sequence alignment problem.","display_name":"A space-efficient algorithm for the constrained pairwise sequence alignment problem.","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1489288704","mag":"1489288704","pmid":"https://pubmed.ncbi.nlm.nih.gov/16901106"},"language":"en","primary_location":{"id":"pmid:16901106","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/16901106","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genome informatics. International Conference on Genome Informatics","raw_type":"Journal Article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["pubmed"],"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/A5023085024","display_name":"Dan He","orcid":"https://orcid.org/0000-0001-9064-566X","observed_orcids":["https://orcid.org/0000-0001-9064-566X"]},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan He","raw_affiliation_strings":["Department of Computer Science, University of Vermont, Burlington, 05405, USA. dhe@cs.uvm.edu","Department of Computer Science University of Vermont"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Vermont, Burlington, 05405, USA. dhe@cs.uvm.edu","institution_ids":["https://openalex.org/I111236770"]},{"raw_affiliation_string":"Department of Computer Science University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072963545","display_name":"Abdullah N. Arslan","orcid":"https://orcid.org/0000-0002-3979-6371","observed_orcids":["https://orcid.org/0000-0002-3979-6371","https://orcid.org/0000-0002-1098-6665"]},"institutions":[{"id":"https://openalex.org/I111236770","display_name":"University of Vermont","ror":"https://ror.org/0155zta11","country_code":"US","type":"education","lineage":["https://openalex.org/I111236770"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abdullah N Arslan","raw_affiliation_strings":["Department of Computer Science University of Vermont"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Vermont","institution_ids":["https://openalex.org/I111236770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111236770"],"apc_list":null,"apc_paid":null,"fwci":0.7496,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"16","issue":"2","first_page":"237","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.861299991607666,"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.861299991607666,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.12210000306367874,"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/T12946","display_name":"Fractal and DNA sequence analysis","score":0.010300000198185444,"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/space-efficient-algorithms","display_name":"memory-efficient algorithms","score":0.7310000061988831},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.6159999966621399},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.7649999856948853},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.4959999918937683},{"id":"https://openalex.org/keywords/optimal-alignment","display_name":"optimal alignment","score":0.5360000133514404},{"id":"https://openalex.org/keywords/protein-sequence-alignment","display_name":"protein sequence alignment","score":0.640999972820282},{"id":"https://openalex.org/keywords/progressive-alignment","display_name":"progressive alignment","score":0.7080000042915344}],"concepts":[{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7350488305091858},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.7242209911346436},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6221345067024231},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5826626420021057},{"id":"https://openalex.org/C88031987","wikidata":"https://www.wikidata.org/wiki/Q1377767","display_name":"Multiple sequence alignment","level":5,"score":0.5823853015899658},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5773450136184692},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5703572630882263},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5511382818222046},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5344592332839966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45585736632347107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44457465410232544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3862474262714386},{"id":"https://openalex.org/C45484198","wikidata":"https://www.wikidata.org/wiki/Q827246","display_name":"Sequence alignment","level":4,"score":0.3337318003177643},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11636143922805786},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C167625842","wikidata":"https://www.wikidata.org/wiki/Q899763","display_name":"Peptide sequence","level":3,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000818","descriptor_name":"Animals","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D011506","descriptor_name":"Proteins","qualifier_ui":"Q000737","qualifier_name":"chemistry","is_major_topic":true},{"descriptor_ui":"D016415","descriptor_name":"Sequence Alignment","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":true},{"descriptor_ui":"D016415","descriptor_name":"Sequence Alignment","qualifier_ui":"Q000706","qualifier_name":"statistics & numerical data","is_major_topic":true},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":true}],"locations_count":2,"locations":[{"id":"pmid:16901106","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/16901106","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Genome informatics. International Conference on Genome Informatics","raw_type":"Journal Article"},{"id":"mag:1489288704","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/16901106","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"PubMed","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":12,"referenced_works":["https://openalex.org/W1578673849","https://openalex.org/W1600463518","https://openalex.org/W1969483458","https://openalex.org/W1974063126","https://openalex.org/W1981089653","https://openalex.org/W1995945562","https://openalex.org/W2088055539","https://openalex.org/W2091380713","https://openalex.org/W2098129242","https://openalex.org/W2108866723","https://openalex.org/W2149400549","https://openalex.org/W2165654401"],"related_works":["https://openalex.org/W7100934350","https://openalex.org/W7097038838","https://openalex.org/W2244278618","https://openalex.org/W7099205519","https://openalex.org/W7099214898","https://openalex.org/W1130115013","https://openalex.org/W7097001911","https://openalex.org/W2094799385","https://openalex.org/W1578673849","https://openalex.org/W2375943101"],"abstract_inverted_index":{"The":[0,56],"constrained":[1,58,167],"pairwise":[2,59],"sequence":[3,169],"alignment":[4,60,77,107,170],"(CPSA)":[5],"problem":[6,111,160],"aims":[7],"to":[8,112],"align":[9],"two":[10],"given":[11,27,54],"sequences":[12,35,133,163],"by":[13,68],"aligning":[14],"their":[15],"similar":[16],"subsequences":[17],"in":[18,142],"the":[19,23,31,34,50,53,82,86,100,109,158,166,178],"same":[20],"region":[21],"under":[22],"guidance":[24],"of":[25,33,52,85,103,157,181,188],"a":[26,69,95,119],"pattern":[28],"(constraint).":[29],"Let":[30],"lengths":[32],"be":[36,49,63],"m,":[37,43],"and":[38,44],"n":[39,41,48],"where":[40],"<or=":[42,47],"let":[45],"r":[46],"length":[51],"pattern.":[55],"optimum":[57],"score":[61],"can":[62],"computed":[64],"using":[65],"O(rn)":[66],"space":[67,83,141,149,179],"naive":[70,87],"dynamic":[71,88],"programming":[72,89],"solution.":[73],"If":[74],"an":[75,105,125],"optimal":[76,106,126],"path":[78],"is":[79,91,94,146,164],"desired":[80],"then":[81],"requirement":[84,102,180],"algorithm":[90,97,122,137,145,175],"O(rnm).":[92],"There":[93],"divide-and-conquer":[96],"that":[98,123,135,185],"reduces":[99],"memory":[101],"finding":[104],"for":[108,161],"CPSA":[110,121,159,174,189],"O(rn).":[113],"In":[114],"this":[115],"paper,":[116],"we":[117],"present":[118],"space-efficient":[120],"returns":[124],"alignment.":[127],"Our":[128,173],"analysis":[129],"on":[130],"real":[131],"protein":[132],"suggests":[134],"our":[136],"requires":[138],"only":[139,148],"O(n)":[140],"practice.":[143],"This":[144],"not":[147],"efficient":[150],"but":[151],"also":[152,176],"very":[153],"fast.":[154],"A":[155],"generalization":[156],"multiple":[162,168],"called":[165],"(CMSA)":[171],"problem.":[172],"improves":[177],"progressive":[182],"CMSA":[183],"algorithms":[184],"use":[186],"solutions":[187],"problems.":[190]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2016-06-24T00:00:00"}