{"id":"https://openalex.org/W1489582159","doi":"https://doi.org/10.1007/11780441_30","title":"Faster Algorithms for Computing Longest Common Increasing Subsequences","display_name":"Faster Algorithms for Computing Longest Common Increasing Subsequences","publication_year":2005,"publication_date":"2005-12-11","ids":{"openalex":"https://openalex.org/W1489582159","doi":"https://doi.org/10.1007/11780441_30","mag":"1489582159"},"language":"en","primary_location":{"id":"doi:10.1007/11780441_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11780441_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://tidsskrift.dk/brics/article/download/21904/19330","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DE","DK"],"is_corresponding":false,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["BRICS, University of Aarhus, \u00c5rhus, Denmark","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, University of Aarhus, \u00c5rhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007039642","display_name":"Kanela Kaligosi","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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":"Kanela Kaligosi","raw_affiliation_strings":["Max-Plank-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Plank-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028865873","display_name":"Irit Katriel","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DE","DK"],"is_corresponding":false,"raw_author_name":"Irit Katriel","raw_affiliation_strings":["BRICS, University of Aarhus, \u00c5rhus, Denmark","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS, University of Aarhus, \u00c5rhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046440423","display_name":"Martin K\u00fctz","orcid":null},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]},{"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":"Martin Kutz","raw_affiliation_strings":["Max-Plank-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Plank-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.9716,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86449506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"37","first_page":"330","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9884999990463257,"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.9884999990463257,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9625999927520752,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9448000192642212,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.5910159349441528},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.561018705368042}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5910159349441528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.561018705368042}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1007/11780441_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11780441_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.7146/brics.v12i37.21904","is_oa":true,"landing_page_url":"https://doi.org/10.7146/brics.v12i37.21904","pdf_url":"https://tidsskrift.dk/brics/article/download/21904/19330","source":{"id":"https://openalex.org/S2764813624","display_name":"BRICS Report Series","issn_l":"0909-0878","issn":["0909-0878","1601-5355"],"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":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BRICS Report Series","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.138.7390","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.7390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/~gerth/Papers/cpm06.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.211.6291","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.6291","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.au.dk/~gerth/papers/cpm06.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.211.6524","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.6524","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.au.dk/~gerth/papers/brics-rs-05-37.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.2437","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.2437","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~mkutz/pubs/BroKatKalKut_LCIS.ps","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:314457","is_oa":false,"landing_page_url":"http://edoc.mpg.de/314457","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":"Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Springer, 330-341 (2006)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.atira.dk:publications/b595df50-adcd-11da-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/b595df50-adcd-11da-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Kaligosi, K, Katriel, I & Kutz, M 2005, 'Faster Algorithms for Computing Longest Common Increasing Subsequences', BRICS Report Series, no. RS-05-37.","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/ebdaf780-c280-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/ebdaf780-c280-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Kaligosi, K, Katriel, I & Kutz, M 2006, Faster Algorithms for Computing Longest Common Increasing Subsequences. in M Lewenstein & G Valiente (eds), Combinatorial Pattern Matching. Springer, Lecture Notes in Computer Science, vol. 4009, pp. 330-341, CPM 2006, 17/12/2010. https://doi.org/10.1007/11780441_30","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_1328389","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-22CB-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:1489582159","is_oa":false,"landing_page_url":"http://pubman.mpdl.mpg.de/pubman/item/escidoc:1328389","pdf_url":null,"source":{"id":"https://openalex.org/S4306533943","display_name":"Untitled Event","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Untitled Event","raw_type":null}],"best_oa_location":{"id":"doi:10.7146/brics.v12i37.21904","is_oa":true,"landing_page_url":"https://doi.org/10.7146/brics.v12i37.21904","pdf_url":"https://tidsskrift.dk/brics/article/download/21904/19330","source":{"id":"https://openalex.org/S2764813624","display_name":"BRICS Report Series","issn_l":"0909-0878","issn":["0909-0878","1601-5355"],"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":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"BRICS Report Series","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1489582159.pdf","grobid_xml":"https://content.openalex.org/works/W1489582159.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1970026646","https://openalex.org/W1979109797","https://openalex.org/W2006656002","https://openalex.org/W2012010763","https://openalex.org/W2027506564","https://openalex.org/W2066885472","https://openalex.org/W2069893028","https://openalex.org/W2078864816","https://openalex.org/W2090021115","https://openalex.org/W2090747326","https://openalex.org/W2142753649","https://openalex.org/W2152064395","https://openalex.org/W2157922500","https://openalex.org/W2165654401"],"related_works":["https://openalex.org/W2027506564","https://openalex.org/W2012010763","https://openalex.org/W2152064395","https://openalex.org/W1970026646","https://openalex.org/W2040176884","https://openalex.org/W1504822866","https://openalex.org/W1567669771","https://openalex.org/W2165654401","https://openalex.org/W2162744351","https://openalex.org/W2109227373","https://openalex.org/W2014678176","https://openalex.org/W2006656002","https://openalex.org/W1999395788","https://openalex.org/W1669848412","https://openalex.org/W1582685874","https://openalex.org/W1602643665","https://openalex.org/W2602180134","https://openalex.org/W2041650430","https://openalex.org/W1983269319","https://openalex.org/W1823536187"],"abstract_inverted_index":{"We":[0],"present":[1,27,75,125],"algorithms":[2,97],"for":[3,90,122,129,148],"finding":[4],"a":[5,87],"longest":[6,115,138],"common":[7,116,139],"increasing":[8],"subsequence":[9,140],"of":[10,19,36,50,57,114],"two":[11,17],"or":[12],"more":[13,85],"input":[14,68],"sequences.":[15],"For":[16,70,134],"sequences":[18,73],"lengths":[20],"m":[21],"and":[22,42,60],"n,":[23],"where":[24,45],"m\u2265n,":[25],"we":[26,74,110,124],"an":[28,31,51,76,126],"algorithm":[29,77,128],"with":[30],"output-dependent":[32],"expected":[33],"running":[34],"time":[35,64],"$O((m+n\\ell)":[37],"\\log\\log":[38],"\\sigma":[39],"+":[40],"{\\ensuremath{\\mathit{Sort}}})$":[41],"O(m)":[43],"space,":[44],"\u2113":[46],"is":[47,54,62],"the":[48,55,58,63,80,112,130,135],"length":[49],"LCIS,":[52],"\u03c3":[53],"size":[56],"alphabet,":[59],"${\\ensuremath{\\mathit{Sort}}}$":[61],"to":[65],"sort":[66],"each":[67],"sequence.":[69],"k\u22653":[71],"length-n":[72],"which":[78,123],"improves":[79],"previous":[81],"best":[82],"bound":[83],"by":[84],"than":[86],"factor":[88],"k":[89],"many":[91],"inputs.":[92],"In":[93],"both":[94],"cases,":[95],"our":[96],"are":[98],"conceptually":[99],"quite":[100],"simple":[101],"but":[102],"rely":[103],"on":[104],"existing":[105],"sophisticated":[106],"data":[107],"structures.":[108],"Finally,":[109],"introduce":[111],"problem":[113],"weakly-increasing":[117],"(or":[118],"non-decreasing)":[119],"subsequences":[120],"(LCWIS),":[121],"O(m+nlogn)-time":[127],"3-letter":[131],"alphabet":[132],"case.":[133],"extensively":[136],"studied":[137],"problem,":[141],"comparable":[142],"speedups":[143],"have":[144],"not":[145],"been":[146],"achieved":[147],"small":[149],"alphabets.":[150]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}