{"id":"https://openalex.org/W7095739231","doi":null,"title":"A Fast Method for Linear Space Pairwise Sequence Alignment","display_name":"A Fast Method for Linear Space Pairwise Sequence Alignment","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095739231"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.329.8787","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.8787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eshare.stut.edu.tw/esharefile/2009_12/2009_12_50c8fd01.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095739231"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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":"Chin-chen Chang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Chin-chen Chang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Yu-chiang Li","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Yu-chiang Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Chia-te Liao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Chia-te Liao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.00419999985024333,"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/T12946","display_name":"Fractal and DNA sequence analysis","score":0.0019000000320374966,"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/pairwise-sequence-alignment","display_name":"pairwise sequence alignment","score":0.9509999752044678},{"id":"https://openalex.org/keywords/linear-space-algorithms","display_name":"linear space algorithms","score":0.8149999976158142},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.8080000281333923},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.7429999709129333},{"id":"https://openalex.org/keywords/memory-reduction","display_name":"memory reduction","score":0.6639999747276306}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.707099974155426},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6974999904632568},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.6370000243186951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6370000243186951},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5449000000953674},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.5304999947547913},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.5160999894142151},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39570000767707825},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C88031987","wikidata":"https://www.wikidata.org/wiki/Q1377767","display_name":"Multiple sequence alignment","level":5,"score":0.32420000433921814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3003000020980835},{"id":"https://openalex.org/C30711495","wikidata":"https://www.wikidata.org/wiki/Q289411","display_name":"Sequence space","level":3,"score":0.2847999930381775},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C45484198","wikidata":"https://www.wikidata.org/wiki/Q827246","display_name":"Sequence alignment","level":4,"score":0.2554999887943268},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.329.8787","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.8787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eshare.stut.edu.tw/esharefile/2009_12/2009_12_50c8fd01.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7095172246","https://openalex.org/W2014145971","https://openalex.org/W67008405","https://openalex.org/W7097564593","https://openalex.org/W1979028376","https://openalex.org/W2367751564","https://openalex.org/W2102659807","https://openalex.org/W2084136254","https://openalex.org/W2392741655","https://openalex.org/W2108215151"],"abstract_inverted_index":{"Abstract:":[0],"Pairwise":[1],"sequence":[2,21],"alignment":[3,22],"is":[4,110],"an":[5,84],"important":[6],"technique":[7],"for":[8,20],"finding":[9],"the":[10,34,47,51,54,67,72,90,95,104,116],"optimal":[11],"arrangement":[12],"between":[13],"two":[14],"sequences.":[15],"A":[16],"basic":[17],"dynamic-programming":[18],"strategy":[19],"needs":[23],"O(mn)":[24,28],"time":[25],"and":[26,60,115],"also":[27,45],"space.":[29,77],"Hirschberg\u2019s":[30,64,113],"divide-and-conquer":[31],"method":[32],"reduces":[33],"required":[35],"space":[36,87],"to":[37,62,93,112],"roughly":[38],"2m":[39],"(m":[40],"\u2264":[41],"n),":[42],"but":[43],"it":[44],"doubles":[46],"computing":[48],"time.":[49],"On":[50],"other":[52],"hand,":[53],"FastLSA":[55,101,117],"approach":[56],"adds":[57],"extra":[58],"rows":[59],"columns":[61],"generalize":[63],"algorithm,":[65,88,92],"reducing":[66],"number":[68],"of":[69,74,97],"recomputations":[70],"at":[71],"cost":[73],"more":[75],"memory":[76],"In":[78],"this":[79],"paper,":[80],"we":[81],"shall":[82],"present":[83],"efficient":[85],"linear":[86],"called":[89],"NFLSA":[91,108],"reduce":[94],"ratio":[96],"recalculation":[98],"greater":[99],"than":[100],"while":[102],"using":[103],"same":[105],"memory.":[106],"The":[107],"algorithm":[109,114,118],"superior":[111],"in":[119],"our":[120],"simulations.":[121]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095739231","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
