{"id":"https://openalex.org/W1533815075","doi":"https://doi.org/10.1007/11682462_33","title":"A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences","display_name":"A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1533815075","doi":"https://doi.org/10.1007/11682462_33","mag":"1533815075"},"language":"en","primary_location":{"id":"doi:10.1007/11682462_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_33","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ho-Kwok Dai","orcid":null},"institutions":[{"id":"https://openalex.org/I115475287","display_name":"Oklahoma State University","ror":"https://ror.org/01g9vbr38","country_code":"US","type":"education","lineage":["https://openalex.org/I115475287"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ho-Kwok Dai","raw_affiliation_strings":["Computer Science Department, Oklahoma State University, Stillwater, Oklahoma, 74078, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Oklahoma State University, Stillwater, Oklahoma, 74078, USA","institution_ids":["https://openalex.org/I115475287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104362623","display_name":"Hung-Chi Su","orcid":null},"institutions":[{"id":"https://openalex.org/I125956826","display_name":"Arkansas State University","ror":"https://ror.org/006pyvd89","country_code":"US","type":"education","lineage":["https://openalex.org/I125956826"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hung-Chi Su","raw_affiliation_strings":["Department of Computer Science, Arkansas State University, Arkansas, 72467, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Arkansas State University, Arkansas, 72467, USA","institution_ids":["https://openalex.org/I125956826"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4885,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.56972438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"337","last_page":"348"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9765999913215637,"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/T11567","display_name":"semigroups and automata theory","score":0.9702000021934509,"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/subsequence","display_name":"Subsequence","score":0.9206545352935791},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.9025151133537292},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7628653049468994},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.732591450214386},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6881533265113831},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5927186012268066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5686455368995667},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4574526846408844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3395283818244934}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.9206545352935791},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.9025151133537292},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7628653049468994},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.732591450214386},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6881533265113831},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5927186012268066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5686455368995667},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4574526846408844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3395283818244934},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11682462_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_33","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1509502258","https://openalex.org/W1965333879","https://openalex.org/W1965998064","https://openalex.org/W1990061958","https://openalex.org/W2008399824","https://openalex.org/W2034123395","https://openalex.org/W2055050002","https://openalex.org/W2083745365","https://openalex.org/W2094519647","https://openalex.org/W2105778456","https://openalex.org/W2120490947","https://openalex.org/W2143462372","https://openalex.org/W4239650500"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}