{"id":"https://openalex.org/W2033687323","doi":"https://doi.org/10.1145/1854776.1854818","title":"The solution space of genome sequence alignment and LIS graph decomposition","display_name":"The solution space of genome sequence alignment and LIS graph decomposition","publication_year":2010,"publication_date":"2010-08-02","ids":{"openalex":"https://openalex.org/W2033687323","doi":"https://doi.org/10.1145/1854776.1854818","mag":"2033687323"},"language":"en","primary_location":{"id":"doi:10.1145/1854776.1854818","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1854776.1854818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology","raw_type":"proceedings-article"},"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":"https://openalex.org/A5039352105","display_name":"Fangrui Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fangrui Ma","raw_affiliation_strings":["University of Nebraska-Lincoln, Lincoln, NE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071975084","display_name":"Jitender S. Deogun","orcid":"https://orcid.org/0000-0001-6402-2549"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jitender S. Deogun","raw_affiliation_strings":["University of Nebraska-Lincoln, Lincoln, NE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13549898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"302","last_page":"311"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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.9987999796867371,"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/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.836491584777832},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6697587370872498},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.610559344291687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5927773118019104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49263888597488403},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4754590392112732},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4644010365009308},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43606075644493103},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.42325037717819214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3518187403678894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27315595746040344},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.10166224837303162},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.08907881379127502}],"concepts":[{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.836491584777832},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6697587370872498},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.610559344291687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5927773118019104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49263888597488403},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4754590392112732},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4644010365009308},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43606075644493103},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.42325037717819214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3518187403678894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27315595746040344},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.10166224837303162},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.08907881379127502},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1854776.1854818","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1854776.1854818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6986470837","display_name":null,"funder_award_id":"EPS-0091900","funder_id":"https://openalex.org/F4320338283","funder_display_name":"Office of Experimental Program to Stimulate Competitive Research"},{"id":"https://openalex.org/G987716116","display_name":"DIGITAL GOVERNMENT: A Geospatial Decision Support System for Drought","funder_award_id":"0091530","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338283","display_name":"Office of Experimental Program to Stimulate Competitive Research","ror":"https://ror.org/04k9mqs78"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W53898165","https://openalex.org/W93895971","https://openalex.org/W178414959","https://openalex.org/W1515357946","https://openalex.org/W1543263356","https://openalex.org/W1986014242","https://openalex.org/W1990061958","https://openalex.org/W1991330646","https://openalex.org/W2036295979","https://openalex.org/W2055043387","https://openalex.org/W2095685450","https://openalex.org/W2100406995","https://openalex.org/W2107248520","https://openalex.org/W2107282968","https://openalex.org/W2109291623","https://openalex.org/W2115711269","https://openalex.org/W2152331922","https://openalex.org/W2155237411","https://openalex.org/W2610179052","https://openalex.org/W2752885492","https://openalex.org/W2798588639","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W6624626827","https://openalex.org/W6750258011","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W3183956626","https://openalex.org/W2136735429"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"an":[5,21,95],"algorithm":[6],"to":[7,54,109],"discover":[8],"the":[9,37,55,62,65,76,85,92,102,111],"optimal":[10],"solution":[11,18,66,93,103],"space":[12,19,104],"of":[13,39,57,64,113],"genome":[14,43,114],"sequence":[15],"alignment.":[16],"The":[17,45],"is":[20,36],"LIS":[22,46],"(longest":[23],"increasing":[24],"subsequence)":[25],"graph,":[26],"which":[27,90],"can":[28,69,105],"be":[29,107],"constructed":[30],"in":[31,41,94],"O(n2)":[32],"time,":[33],"where":[34],"n":[35],"number":[38],"MUMs":[40],"given":[42],"sequences.":[44,115],"graph":[47],"has":[48],"many":[49],"unique":[50],"properties":[51],"that":[52,78],"lead":[53],"development":[56],"efficient":[58],"decomposition":[59,86],"algorithms.":[60],"With":[61],"availability":[63],"space,":[67],"users":[68],"examine":[70],"all":[71],"possible":[72],"solutions":[73],"and":[74,97],"pick":[75],"one":[77],"best":[79],"meet":[80],"their":[81],"needs.":[82],"We":[83],"provide":[84],"tree":[87],"traversal":[88],"algorithm,":[89],"outputs":[91],"elegant":[96],"compact":[98],"clustered":[99],"form.":[100],"Moreover,":[101],"also":[106],"used":[108],"study":[110],"homology":[112]},"counts_by_year":[],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}