{"id":"https://openalex.org/W2045716015","doi":"https://doi.org/10.1109/bibm.2010.5706551","title":"An algorithm for mapping short reads to a dynamically changing genomic sequence","display_name":"An algorithm for mapping short reads to a dynamically changing genomic sequence","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2045716015","doi":"https://doi.org/10.1109/bibm.2010.5706551","mag":"2045716015"},"language":"en","primary_location":{"id":"doi:10.1109/bibm.2010.5706551","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibm.2010.5706551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","raw_type":"proceedings-article"},"type":"article","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/A5024578874","display_name":"Tom\u00e1\u0161 Flouri","orcid":"https://orcid.org/0000-0002-8474-9507"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Tomas Flouri","raw_affiliation_strings":["Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030676152","display_name":"Jan Holub","orcid":"https://orcid.org/0000-0003-3022-2694"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Holub","raw_affiliation_strings":["Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]},{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]},{"id":"https://openalex.org/I4210119896","display_name":"King's College School","ror":"https://ror.org/02bbqcn27","country_code":"GB","type":"education","lineage":["https://openalex.org/I4210119896"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"Costas Iliopoulos","raw_affiliation_strings":["Department of Computer Science, King''s College, London, UK","Digital Ecosystems & Business Intelligence Institute, Curtin University of Technology, Perth, WA, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King''s College, London, UK","institution_ids":["https://openalex.org/I4210119896","https://openalex.org/I183935753"]},{"raw_affiliation_string":"Digital Ecosystems & Business Intelligence Institute, Curtin University of Technology, Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051275317","display_name":"Solon P. Pissis","orcid":"https://orcid.org/0000-0002-1445-1932"},"institutions":[{"id":"https://openalex.org/I4210119896","display_name":"King's College School","ror":"https://ror.org/02bbqcn27","country_code":"GB","type":"education","lineage":["https://openalex.org/I4210119896"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Solon Pissis","raw_affiliation_strings":["Department of Computer Science, King''s College, London, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King''s College, London, UK","institution_ids":["https://openalex.org/I4210119896","https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024578874"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":3.9304,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.94258468,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"136"},"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.9986000061035156,"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.9983000159263611,"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/sequence","display_name":"Sequence (biology)","score":0.6824373006820679},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6804202795028687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5625916719436646},{"id":"https://openalex.org/keywords/genomics","display_name":"Genomics","score":0.45700016617774963},{"id":"https://openalex.org/keywords/reference-genome","display_name":"Reference genome","score":0.45666295289993286},{"id":"https://openalex.org/keywords/sequence-assembly","display_name":"Sequence assembly","score":0.42725926637649536},{"id":"https://openalex.org/keywords/dna-sequencing","display_name":"DNA sequencing","score":0.4131668210029602},{"id":"https://openalex.org/keywords/computational-biology","display_name":"Computational biology","score":0.36341455578804016},{"id":"https://openalex.org/keywords/genome","display_name":"Genome","score":0.3447796702384949},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.21478357911109924},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.15502998232841492},{"id":"https://openalex.org/keywords/dna","display_name":"DNA","score":0.08426311612129211}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6824373006820679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6804202795028687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5625916719436646},{"id":"https://openalex.org/C189206191","wikidata":"https://www.wikidata.org/wiki/Q222046","display_name":"Genomics","level":4,"score":0.45700016617774963},{"id":"https://openalex.org/C192953774","wikidata":"https://www.wikidata.org/wiki/Q7307127","display_name":"Reference genome","level":4,"score":0.45666295289993286},{"id":"https://openalex.org/C18949551","wikidata":"https://www.wikidata.org/wiki/Q740578","display_name":"Sequence assembly","level":5,"score":0.42725926637649536},{"id":"https://openalex.org/C51679486","wikidata":"https://www.wikidata.org/wiki/Q380546","display_name":"DNA sequencing","level":3,"score":0.4131668210029602},{"id":"https://openalex.org/C70721500","wikidata":"https://www.wikidata.org/wiki/Q177005","display_name":"Computational biology","level":1,"score":0.36341455578804016},{"id":"https://openalex.org/C141231307","wikidata":"https://www.wikidata.org/wiki/Q7020","display_name":"Genome","level":3,"score":0.3447796702384949},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.21478357911109924},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.15502998232841492},{"id":"https://openalex.org/C552990157","wikidata":"https://www.wikidata.org/wiki/Q7430","display_name":"DNA","level":2,"score":0.08426311612129211},{"id":"https://openalex.org/C162317418","wikidata":"https://www.wikidata.org/wiki/Q252857","display_name":"Transcriptome","level":4,"score":0.0},{"id":"https://openalex.org/C150194340","wikidata":"https://www.wikidata.org/wiki/Q26972","display_name":"Gene expression","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/bibm.2010.5706551","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibm.2010.5706551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/42a43129-989b-4456-baa2-f7bf00794af0","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/42a43129-989b-4456-baa2-f7bf00794af0","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Flouri , T , Holub , J , Iliopoulos , C S & Pissis , S P 2010 , An algorithm for mapping short reads to a dynamically changing genomic sequence . in T Park , L Chen , L Wong , S Tsui , M Ng & X Hu (eds) , 2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) . pp. 133-136 . https://doi.org/10.1109/BIBM.2010.5706551","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1990061958","https://openalex.org/W2049881004","https://openalex.org/W2096441981","https://openalex.org/W2097341408","https://openalex.org/W2103441770","https://openalex.org/W2124985265","https://openalex.org/W2129264270","https://openalex.org/W2168401659"],"related_works":["https://openalex.org/W4210830088","https://openalex.org/W2767590279","https://openalex.org/W2216477337","https://openalex.org/W2772185703","https://openalex.org/W3011183076","https://openalex.org/W2794893153","https://openalex.org/W2721624558","https://openalex.org/W2079322808","https://openalex.org/W2584868213","https://openalex.org/W2795731640"],"abstract_inverted_index":{"The":[0,116],"constant":[1],"advances":[2],"in":[3,56],"sequencing":[4,11],"technology":[5],"have":[6],"redefined":[7],"the":[8,113,122,130],"way":[9],"genome":[10],"is":[12],"performed.":[13],"They":[14],"are":[15,55],"able":[16],"to":[17,40,52,84,128,137],"produce":[18],"tens":[19],"of":[20,22,44,78,132,135],"millions":[21,134],"short":[23],"sequences":[24,54],"(reads),":[25],"during":[26],"a":[27,32,75,85,92,98],"single":[28],"experiment,":[29],"and":[30,59],"with":[31],"much":[33],"lower":[34],"cost":[35],"than":[36],"previously":[37],"possible.":[38],"Due":[39],"this":[41,71,79],"massive":[42],"amount":[43],"data,":[45],"efficient":[46],"algorithms":[47],"for":[48,66],"mapping":[49,81,133],"these":[50,82],"reads":[51,83,136],"reference":[53],"great":[57],"demand,":[58],"recently,":[60],"there":[61],"has":[62],"been":[63],"ample":[64],"work":[65],"publishing":[67],"such":[68],"algorithms.":[69],"In":[70],"paper,":[72],"we":[73],"study":[74],"different":[76],"version":[77],"problem:":[80],"dynamically":[86],"changing":[87],"genomic":[88,114,139],"sequence.":[89,115],"We":[90],"propose":[91],"new":[93],"practical":[94],"algorithm,":[95],"which":[96],"employs":[97],"suitable":[99],"data":[100],"structure":[101],"that":[102,121],"takes":[103],"into":[104],"account":[105],"potential":[106],"dynamic":[107],"effects":[108],"(replacements,":[109],"insertions,":[110],"deletions)":[111],"on":[112],"presented":[117],"experimental":[118],"results":[119],"demonstrate":[120],"proposed":[123],"approach":[124],"can":[125],"be":[126],"applied":[127],"address":[129],"problem":[131],"multiple":[138],"sequences.":[140]},"counts_by_year":[{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}