{"id":"https://openalex.org/W1986693456","doi":"https://doi.org/10.1142/s0219720005000928","title":"A TABU SEARCH ALGORITHM FOR POST-PROCESSING MULTIPLE SEQUENCE ALIGNMENT","display_name":"A TABU SEARCH ALGORITHM FOR POST-PROCESSING MULTIPLE SEQUENCE ALIGNMENT","publication_year":2005,"publication_date":"2005-02-01","ids":{"openalex":"https://openalex.org/W1986693456","doi":"https://doi.org/10.1142/s0219720005000928","mag":"1986693456","pmid":"https://pubmed.ncbi.nlm.nih.gov/15751117"},"language":"en","primary_location":{"id":"doi:10.1142/s0219720005000928","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219720005000928","pdf_url":null,"source":{"id":"https://openalex.org/S155349577","display_name":"Journal of Bioinformatics and Computational Biology","issn_l":"0219-7200","issn":["0219-7200","1757-6334"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Bioinformatics and Computational Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","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/A5030690018","display_name":"Tariq Riaz","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148498","display_name":"Bioinformatics Institute","ror":"https://ror.org/044w3nw43","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I2801752549","https://openalex.org/I4210148498"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"TARIQ RIAZ","raw_affiliation_strings":["Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore","institution_ids":["https://openalex.org/I4210148498"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103557908","display_name":"Wang Yi","orcid":null},"institutions":[{"id":"https://openalex.org/I115228651","display_name":"Agency for Science, Technology and Research","ror":"https://ror.org/036wvzt09","country_code":"SG","type":"government","lineage":["https://openalex.org/I115228651"]},{"id":"https://openalex.org/I4210148498","display_name":"Bioinformatics Institute","ror":"https://ror.org/044w3nw43","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I2801752549","https://openalex.org/I4210148498"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"WANG YI","raw_affiliation_strings":["Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore","Agency for Science, Technology and Research"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore","institution_ids":["https://openalex.org/I4210148498"]},{"raw_affiliation_string":"Agency for Science, Technology and Research","institution_ids":["https://openalex.org/I115228651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111649796","display_name":"Kuo-Bin Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4210148498","display_name":"Bioinformatics Institute","ror":"https://ror.org/044w3nw43","country_code":"SG","type":"facility","lineage":["https://openalex.org/I115228651","https://openalex.org/I2801752549","https://openalex.org/I4210148498"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"KUO-BIN LI","raw_affiliation_strings":["Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore"],"affiliations":[{"raw_affiliation_string":"Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore","institution_ids":["https://openalex.org/I4210148498"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030690018"],"corresponding_institution_ids":["https://openalex.org/I4210148498"],"apc_list":null,"apc_paid":null,"fwci":0.8775,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.79521613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"03","issue":"01","first_page":"145","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9902999997138977,"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/tabu-search","display_name":"Tabu search","score":0.939419686794281},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6570112109184265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6053824424743652},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5793943405151367},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5789152979850769},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.5605691075325012},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.5600225925445557},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5194249153137207},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4795110523700714},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.45356959104537964},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4246167838573456},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4138911962509155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2993827760219574}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.939419686794281},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6570112109184265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6053824424743652},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5793943405151367},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5789152979850769},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.5605691075325012},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5600225925445557},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5194249153137207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4795110523700714},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.45356959104537964},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4246167838573456},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4138911962509155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2993827760219574},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D001185","descriptor_name":"Artificial Intelligence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D016415","descriptor_name":"Sequence Alignment","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D016415","descriptor_name":"Sequence Alignment","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D016415","descriptor_name":"Sequence Alignment","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D017124","descriptor_name":"Conserved Sequence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017124","descriptor_name":"Conserved Sequence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017124","descriptor_name":"Conserved Sequence","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017385","descriptor_name":"Sequence Homology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017385","descriptor_name":"Sequence Homology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017385","descriptor_name":"Sequence Homology","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D017421","descriptor_name":"Sequence Analysis","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D017421","descriptor_name":"Sequence Analysis","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D017421","descriptor_name":"Sequence Analysis","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1142/s0219720005000928","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219720005000928","pdf_url":null,"source":{"id":"https://openalex.org/S155349577","display_name":"Journal of Bioinformatics and Computational Biology","issn_l":"0219-7200","issn":["0219-7200","1757-6334"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Bioinformatics and Computational Biology","raw_type":"journal-article"},{"id":"pmid:15751117","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/15751117","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,"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":"Journal of bioinformatics and computational biology","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1586365479","https://openalex.org/W1600248575","https://openalex.org/W1969153299","https://openalex.org/W1974326986","https://openalex.org/W2014846325","https://openalex.org/W2030750720","https://openalex.org/W2047923658","https://openalex.org/W2069339318","https://openalex.org/W2102941368","https://openalex.org/W2105006906","https://openalex.org/W2106882534","https://openalex.org/W2107566660","https://openalex.org/W2114951958","https://openalex.org/W2120159299","https://openalex.org/W2128613007","https://openalex.org/W2143153057","https://openalex.org/W2144362290","https://openalex.org/W2148311769","https://openalex.org/W2150560290","https://openalex.org/W2163860567","https://openalex.org/W2171957417","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W2560221187","https://openalex.org/W2494989913","https://openalex.org/W1987877777","https://openalex.org/W1537780499","https://openalex.org/W2794858631","https://openalex.org/W2901129955","https://openalex.org/W4312928368","https://openalex.org/W1492450056","https://openalex.org/W1843628981","https://openalex.org/W2329077287"],"abstract_inverted_index":{"Tabu":[0],"search":[1,25,36,64,108],"is":[2,7,57,84,92,109,133],"a":[3,28,74,80],"meta-heuristic":[4],"approach":[5],"that":[6,106],"proven":[8],"to":[9,26,38,86,111],"be":[10],"useful":[11],"in":[12],"solving":[13],"combinatorial":[14],"optimization":[15],"problems.":[16],"We":[17,101],"implement":[18],"the":[19,35,44,95,113],"adaptive":[20],"memory":[21,33],"features":[22,65],"of":[23,73,115,130],"tabu":[24,63,107],"refine":[27],"multiple":[29,116],"sequence":[30],"alignment.":[31],"Adaptive":[32],"helps":[34],"process":[37],"avoid":[39],"local":[40],"optima":[41],"and":[42,48,69,79,125],"explores":[43],"solution":[45,75],"space":[46],"economically":[47],"effectively":[49],"without":[50],"getting":[51],"trapped":[52],"into":[53],"cycles.":[54],"The":[55,71,90,127],"algorithm":[56,91,132],"further":[58],"enhanced":[59],"by":[60,119],"introducing":[61],"extended":[62],"such":[66,122],"as":[67,123],"intensification":[68],"diversification.":[70],"neighborhoods":[72],"are":[76],"generated":[77,118],"stochastically":[78],"consistency-based":[81],"objective":[82],"function":[83],"employed":[85],"measure":[87],"its":[88],"quality.":[89],"tested":[93],"with":[94],"datasets":[96],"from":[97],"BAliBASE":[98],"benchmarking":[99],"database.":[100],"have":[102],"observed":[103],"through":[104],"experiments":[105],"able":[110],"improve":[112],"quality":[114],"alignments":[117],"other":[120],"software":[121],"ClustalW":[124],"T-Coffee.":[126],"source":[128],"code":[129],"our":[131],"available":[134],"at":[135],"http://www.bii.a-star.edu.sg/~tariq/tabu/.":[136]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}