{"id":"https://openalex.org/W2023483600","doi":"https://doi.org/10.1109/bibe.2007.4375711","title":"A Suffix Tree Construction Algorithm for DNA Sequences","display_name":"A Suffix Tree Construction Algorithm for DNA Sequences","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2023483600","doi":"https://doi.org/10.1109/bibe.2007.4375711","mag":"2023483600"},"language":"en","primary_location":{"id":"doi:10.1109/bibe.2007.4375711","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibe.2007.4375711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 7th International Symposium on BioInformatics and BioEngineering","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/A5072102175","display_name":"Hongwei Huo","orcid":"https://orcid.org/0000-0002-5436-1851"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hongwei Huo","raw_affiliation_strings":["School of Computer Science and Technology, Xidian University, Xi'an, China","School of Computer Science and Technology, Xidian University, Xi'an, 710071, China. hwhuo@mail.xidian.edu.cn"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University, Xi'an, China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"School of Computer Science and Technology, Xidian University, Xi'an, 710071, China. hwhuo@mail.xidian.edu.cn","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004224939","display_name":"Vojislav Stojkovic","orcid":null},"institutions":[{"id":"https://openalex.org/I83909951","display_name":"Morgan State University","ror":"https://ror.org/017d8gk22","country_code":"US","type":"education","lineage":["https://openalex.org/I83909951"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vojislav Stojkovic","raw_affiliation_strings":["Computer Science Department, Morgan State University Baltimore, Baltimore, MD, USA","Computer Science Department, Morgan State University, Baltimore, MD 21251, USA. stojkovi@jewel.morgan.edu"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Morgan State University Baltimore, Baltimore, MD, USA","institution_ids":["https://openalex.org/I83909951"]},{"raw_affiliation_string":"Computer Science Department, Morgan State University, Baltimore, MD 21251, USA. stojkovi@jewel.morgan.edu","institution_ids":["https://openalex.org/I83909951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072102175"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":1.4077,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84875679,"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":"1178","last_page":"1182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9934999942779541,"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/T12254","display_name":"Machine Learning in Bioinformatics","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/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.925710916519165},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.8963375687599182},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.8396049737930298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6935901045799255},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.6722369194030762},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6635671854019165},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5218871235847473},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5071921348571777},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43768760561943054},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4297259449958801},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42127883434295654},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.4184044897556305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21429243683815002},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06315350532531738}],"concepts":[{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.925710916519165},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.8963375687599182},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.8396049737930298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6935901045799255},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6722369194030762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6635671854019165},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5218871235847473},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5071921348571777},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43768760561943054},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4297259449958801},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42127883434295654},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.4184044897556305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21429243683815002},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06315350532531738},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bibe.2007.4375711","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bibe.2007.4375711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE 7th International Symposium on BioInformatics and BioEngineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1807007002","https://openalex.org/W1985108724","https://openalex.org/W1986324942","https://openalex.org/W2030962049","https://openalex.org/W2059513841","https://openalex.org/W2095685450","https://openalex.org/W2111038374","https://openalex.org/W2121252285","https://openalex.org/W2134826720","https://openalex.org/W2152331922","https://openalex.org/W2533248932","https://openalex.org/W6676953311","https://openalex.org/W7062298796"],"related_works":["https://openalex.org/W2003608043","https://openalex.org/W2405892617","https://openalex.org/W153119118","https://openalex.org/W2583658747","https://openalex.org/W4293529780","https://openalex.org/W2158874082","https://openalex.org/W1575722140","https://openalex.org/W2073921136","https://openalex.org/W1965532872","https://openalex.org/W3092594492"],"abstract_inverted_index":{"The":[0,100,132],"suffix":[1,17,34,38,76,90],"tree":[2,35,77,91],"is":[3,24,69,95,106,139],"a":[4,25,65,75,143],"powerful":[5],"data":[6],"structure":[7],"in":[8,22,108,120,129],"string":[9],"processing":[10],"and":[11,123,141],"DNA":[12,93],"sequence":[13],"comparisons.":[14],"However,":[15],"constructing":[16],"trees":[18],"being":[19],"very":[20],"greedy":[21],"space":[23,81,121],"fatal":[26],"drawback.":[27],"In":[28,59],"addition,":[29],"the":[30,33,44,47,56,72,103,109,130,136,150],"performance":[31,145],"of":[32,46,49,55,74],"construction":[36],"using":[37,97],"link":[39],"will":[40],"rapidly":[41],"degrade":[42],"with":[43,117],"increase":[45],"scale":[48],"sequences":[50,94],"to":[51,61,88],"be":[52],"handled":[53],"because":[54],"random":[57],"access.":[58],"order":[60],"overcome":[62],"these":[63],"disadvantages,":[64],"new":[66],"bit":[67],"layout":[68],"used":[70],"for":[71,92,102],"nodes":[73],"which":[78],"has":[79,142],"less":[80],"requirements.":[82],"Based":[83],"on":[84,149],"this":[85],"an":[86],"algorithm":[87,105,119,138,148],"construct":[89],"proposed":[96,104,137],"partitioning":[98],"strategies.":[99],"effectiveness":[101],"shown":[107],"testing":[110],"cases":[111],"from":[112],"NCBI":[113],"web":[114],"site.":[115],"Comparisons":[116],"Kurtz's":[118,147],"requirements":[122],"running":[124,152],"time":[125],"have":[126],"been":[127],"made":[128],"experiments.":[131],"results":[133],"show":[134],"that":[135],"memory-efficient":[140],"better":[144],"over":[146],"average":[151],"time.":[153]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}