{"id":"https://openalex.org/W2115407612","doi":"https://doi.org/10.1137/s0097539704440430","title":"An Optimal Algorithm for the Maximum-Density Segment Problem","display_name":"An Optimal Algorithm for the Maximum-Density Segment Problem","publication_year":2004,"publication_date":"2004-12-10","ids":{"openalex":"https://openalex.org/W2115407612","doi":"https://doi.org/10.1137/s0097539704440430","mag":"2115407612"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704440430","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704440430","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/cs/0311020","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kai-min Chung","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kai-min Chung","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hsueh-I Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hsueh-I Lu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1594,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.87421399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"34","issue":"2","first_page":"373","last_page":"387"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.47519999742507935,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.47519999742507935,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.23019999265670776,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.12430000305175781,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6521000266075134},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6222000122070312},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.5748999714851379},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.45019999146461487},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.39329999685287476},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.3792000114917755},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.3727000057697296},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35440000891685486}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6521000266075134},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6222000122070312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5888000130653381},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.5748999714851379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5083000063896179},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.45019999146461487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4016999900341034},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.3792000114917755},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.3249000012874603},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30390000343322754},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28040000796318054},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2727999985218048},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539704440430","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704440430","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0311020","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0311020","pdf_url":"https://arxiv.org/pdf/cs/0311020","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:cs/0311020","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0311020","pdf_url":"https://arxiv.org/pdf/cs/0311020","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1531710418","https://openalex.org/W1535880051","https://openalex.org/W1749274007","https://openalex.org/W1977778407","https://openalex.org/W1982126317","https://openalex.org/W1989563297","https://openalex.org/W1992066230","https://openalex.org/W1993863888","https://openalex.org/W1993949040","https://openalex.org/W1996423252","https://openalex.org/W2012082177","https://openalex.org/W2014994812","https://openalex.org/W2015858208","https://openalex.org/W2038359695","https://openalex.org/W2041677039","https://openalex.org/W2041878492","https://openalex.org/W2041918279","https://openalex.org/W2050420176","https://openalex.org/W2051656366","https://openalex.org/W2064438511","https://openalex.org/W2065333406","https://openalex.org/W2080810562","https://openalex.org/W2086065942","https://openalex.org/W2094051433","https://openalex.org/W2104354852","https://openalex.org/W2114510609","https://openalex.org/W2115613939","https://openalex.org/W2127457293","https://openalex.org/W2131669390","https://openalex.org/W2135884205","https://openalex.org/W2138790911","https://openalex.org/W2139227232","https://openalex.org/W2139516179","https://openalex.org/W2140008985","https://openalex.org/W2140596904","https://openalex.org/W2141656459","https://openalex.org/W2157052969","https://openalex.org/W4232522389","https://openalex.org/W4236413252"],"related_works":[],"abstract_inverted_index":{"We":[0],"address":[1],"a":[2,21,80,185,213],"fundamental":[3],"problem":[4,76,159,237],"arising":[5],"from":[6],"analysis":[7],"of":[8,14,24,36,42,51,117,215,230],"biomolecular":[9],"sequences.":[10,210],"The":[11,49,73,102],"input":[12,195,216],"consists":[13],"two":[15],"numbers":[16],"wmin":[17,88,149],"and":[18,20,47,114,128,174,232],"wmax":[19,100],"sequence":[22,196],"S":[23,37,43,218,231,239],"n":[25],"number":[26],"pairs":[27],"(ai,wi)":[28],"with":[29,87,208],"wi":[30,66,90,92],">":[31],"0.":[32],"Let":[33],"segmentS":[34],"(i,j)":[35],"be":[38],"the":[39,108,118,153,158,166,190,194,228,234],"consecutive":[40],"subsequence":[41],"between":[44],"indices":[45],"i":[46],"j.":[48],"density":[50],"S(i,j)":[52,86],"is":[53,77,202],"d(i,j)":[54],"=":[55],"(ai":[56],"+":[57,59,61,63,65,67,69,71,91,93,95,97],"ai":[58],"1":[60,68,94],"\\cdots":[62,70,96],"aj)/(wi":[64],"wj)$.":[72],"maximum-density":[74,81,235],"segment":[75,82,236],"to":[78,111,192,226],"find":[79],"over":[83],"all":[84],"segments":[85],"\\leq":[89,99],"wj":[98],".":[101],"best":[103],"previously":[104],"known":[105],"algorithm":[106,188],"for":[107,206,212,238],"problem,":[109],"due":[110],"Goldwasser,":[112],"Kao,":[113],"Lu":[115],"[Proceedings":[116],"Second":[119],"International":[120],"Workshop":[121],"on":[122],"Algorithms":[123],"in":[124,134,145,160,197,220,240],"Bioinformatics,":[125],"R.":[126],"Guig\u00f3":[127],"D.":[129],"Gusfield,":[130],"eds.,":[131],"Lecture":[132],"Notes":[133],"Comput.":[135,177],"Sci.":[136],"2452,":[137],"Springer-Verlag,":[138],"New":[139],"York,":[140],"2002,":[141],"pp.":[142,182],"157--171],":[143],"runs":[144],"O(n":[146],"log(wmax":[147],"-":[148],"+1))":[150],"time.":[151,162,242],"In":[152],"present":[154],"paper,":[155],"we":[156,223],"solve":[157,233],"O(n)":[161],"Our":[163],"approach":[164],"bypasses":[165],"complicated":[167],"right-skew":[168],"decomposition,":[169],"introduced":[170],"by":[171],"Lin,":[172],"Jiang,":[173],"Chao":[175],"[J.":[176],"System":[178],"Sci.,":[179],"65":[180],"(2002),":[181],"570--586].":[183],"As":[184],"result,":[186],"our":[187],"has":[189],"capability":[191],"process":[193],"an":[198,203],"online":[199],"manner,":[200],"which":[201],"important":[204],"feature":[205],"dealing":[207],"genome-scale":[209],"Moreover,":[211],"type":[214],"sequences":[217],"representable":[219],"O(m)":[221,241],"space,":[222],"show":[224],"how":[225],"exploit":[227],"sparsity":[229]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2016-06-24T00:00:00"}