{"id":"https://openalex.org/W1966912586","doi":"https://doi.org/10.1145/996546.996552","title":"A learning algorithm for the longest common subsequence problem","display_name":"A learning algorithm for the longest common subsequence problem","publication_year":2003,"publication_date":"2003-12-31","ids":{"openalex":"https://openalex.org/W1966912586","doi":"https://doi.org/10.1145/996546.996552","mag":"1966912586"},"language":"en","primary_location":{"id":"doi:10.1145/996546.996552","is_oa":false,"landing_page_url":"https://doi.org/10.1145/996546.996552","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-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/A5051393184","display_name":"Eric Breimer","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eric A. Breimer","raw_affiliation_strings":["Rensselaer Polytechnic Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104492185","display_name":"Mark Goldberg","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark K. Goldberg","raw_affiliation_strings":["Rensselaer Polytechnic Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050599556","display_name":"Darren Lim","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Darren T. Lim","raw_affiliation_strings":["Rensselaer Polytechnic Institute"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rensselaer Polytechnic Institute","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051393184"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.09761515,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","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.9998999834060669,"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.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980000257492065,"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/T11567","display_name":"semigroups and automata theory","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/oracle","display_name":"Oracle","score":0.7964427471160889},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7389949560165405},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.629014253616333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.55694180727005},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5550306439399719},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.5113980174064636},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5030903220176697},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.46126750111579895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3813599646091461},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.10174614191055298}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7964427471160889},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7389949560165405},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.629014253616333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.55694180727005},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5550306439399719},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.5113980174064636},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5030903220176697},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.46126750111579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3813599646091461},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.10174614191055298},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/996546.996552","is_oa":false,"landing_page_url":"https://doi.org/10.1145/996546.996552","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.9008","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.9008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unm.edu/~moret/ALENEX00/breimer.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.7090","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.7090","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unm.edu/Conferences/ALENEX00/breimer.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.716","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.716","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.rpi.edu/pub/goldberg/lcs-learning.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1501400124","https://openalex.org/W1558845729","https://openalex.org/W1567669771","https://openalex.org/W1970026646","https://openalex.org/W1986454855","https://openalex.org/W2010260400","https://openalex.org/W2011632873","https://openalex.org/W2012010763","https://openalex.org/W2019211725","https://openalex.org/W2019363670","https://openalex.org/W2027506564","https://openalex.org/W2041650430","https://openalex.org/W2071184135","https://openalex.org/W2086227300","https://openalex.org/W2087064593","https://openalex.org/W2130200371","https://openalex.org/W2162744351","https://openalex.org/W2165654401","https://openalex.org/W2984760229","https://openalex.org/W4238893454","https://openalex.org/W6738852829"],"related_works":["https://openalex.org/W48421712","https://openalex.org/W2354750595","https://openalex.org/W2380032097","https://openalex.org/W1520631193","https://openalex.org/W4367845127","https://openalex.org/W2131252641","https://openalex.org/W1492464344","https://openalex.org/W2470393246","https://openalex.org/W1511188453","https://openalex.org/W1966912586"],"abstract_inverted_index":{"We":[0,110,230],"present":[1],"an":[2,18,25,40,57],"experimental":[3],"study":[4],"of":[5,39,53,75,105,118,125,131,136,168,180,184,204,212,238,247,260,273],"a":[6,50,63,72,79,103,142,271],"learning":[7,33,60,77,119,140],"algorithm":[8,23,61,172,207,234],"for":[9,91],"the":[10,22,37,59,86,92,95,116,129,169,178,187,194,205,222,232,258,268,274,278],"longest":[11],"common":[12],"subsequence":[13],"problem,":[14],"LCS":[15,26,46,65,108],".":[16,280],"Given":[17],"arbitrary":[19,126],"input":[20],"domain,":[21],"learns":[24],"-procedure":[27,97,224],"tailored":[28],"to":[29,113,123,209,235,249,257,262],"that":[30,173],"domain.":[31],"The":[32,88,201,252],"is":[34,82,94],"done":[35],"with":[36,144,158,267],"help":[38],"oracle,":[41,58],"which":[42,81,148],"can":[43],"be":[44],"any":[45],"-algorithm.":[47,109],"After":[48],"solving":[49],"limited":[51],"number":[52],"training":[54,242],"inputs":[55,122,124,135,183,211],"using":[56],"outputs":[62],"new":[64],"-procedure.Our":[66],"experiments":[67,93],"demonstrate":[68],"that,":[69],"by":[70,98,241,277],"allowing":[71],"slight":[73],"loss":[74],"optimality,":[76],"yields":[78,141],"procedure":[80],"significantly":[83],"faster":[84,192,220],"than":[85,193,221],"oracle.":[87],"oracle":[89],"used":[90,276],"np":[96,195,223,279],"Wu":[99],"et":[100],"al.":[101],",":[102,139],"modification":[104],"Myers'":[106],"classical":[107],"show":[111],"how":[112],"scale":[114],"up":[115,248,256,261],"results":[117],"on":[120,243],"small":[121],"lengths.":[127],"For":[128,177],"domain":[130,179],"two":[132],"random":[133,181,210,244],"2-symbol":[134,182],"length":[137,185,213,250],"n":[138,153,161,164],"program":[143,188],"0.999":[145],"expected":[146],"accuracy,":[147],"runs":[149,189,216],"in":[150,156,270],"O":[151,159],"(":[152,160],"1.41":[154],")-time,":[155],"contrast":[157],"2":[162],"/log":[163],")":[165],"running":[166],"time":[167,275],"fastest":[170],"theoretical":[171],"produces":[174,265],"optimal":[175],"solutions.":[176,229],"100,000,":[186],"10.5":[190],"times":[191,219],"-procedure,":[196],"producing":[197],"0.999-":[198,227],"accurate":[199,228],"outputs.":[200],"scaled":[202,255],"version":[203],"evolved":[206,233,253],"applied":[208],"1":[214],"million":[215],"approximately":[217],"30":[218],"while":[225],"constructing":[226],"apply":[231],"DNA":[236],"sequences":[237,246],"various":[239],"lengths":[240,259],"4-symbol":[245],"10,000.":[251],"algorithm,":[254],"1.8":[263],"million,":[264],"solutions":[266],"0.998-accuracy":[269],"fraction":[272]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}