{"id":"https://openalex.org/W2143682947","doi":"https://doi.org/10.1109/rcis.2015.7128871","title":"A sequence-based tree similarity search","display_name":"A sequence-based tree similarity search","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W2143682947","doi":"https://doi.org/10.1109/rcis.2015.7128871","mag":"2143682947"},"language":"en","primary_location":{"id":"doi:10.1109/rcis.2015.7128871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rcis.2015.7128871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 9th International Conference on Research Challenges in Information Science (RCIS)","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/A5046373717","display_name":"Alsayed Algergawy","orcid":"https://orcid.org/0000-0002-8550-4720"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]},{"id":"https://openalex.org/I21376657","display_name":"Tanta University","ror":"https://ror.org/016jp5b92","country_code":"EG","type":"education","lineage":["https://openalex.org/I21376657"]}],"countries":["DE","EG"],"is_corresponding":true,"raw_author_name":"Alsayed Algergawy","raw_affiliation_strings":["Department of Computer Engineering, Tanta University, Tanta, Egypt","Heinz Nixdorf Chair for Distributed Information Systems, Friedrich Schiller University of Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Tanta University, Tanta, Egypt","institution_ids":["https://openalex.org/I21376657"]},{"raw_affiliation_string":"Heinz Nixdorf Chair for Distributed Information Systems, Friedrich Schiller University of Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080030614","display_name":"Friederike Klan","orcid":"https://orcid.org/0000-0002-1856-7334"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Friederike Klan","raw_affiliation_strings":["Heinz Nixdorf Chair for Distributed Information Systems, Friedrich Schiller University of Jena, Germany"],"affiliations":[{"raw_affiliation_string":"Heinz Nixdorf Chair for Distributed Information Systems, Friedrich Schiller University of Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046373717"],"corresponding_institution_ids":["https://openalex.org/I21376657","https://openalex.org/I76198965"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09182603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":null,"first_page":"121","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.984499990940094,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9805999994277954,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7303582429885864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7063763737678528},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6160316467285156},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6134868860244751},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5799659490585327},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5399017930030823},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5074884295463562},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4828556180000305},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.46994641423225403},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.45214399695396423},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.4517121911048889},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.428529292345047},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3762284815311432},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3597976863384247},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.3021654188632965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28872203826904297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20026519894599915},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.17325514554977417},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.10186457633972168},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.08860939741134644}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7303582429885864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7063763737678528},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6160316467285156},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6134868860244751},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5799659490585327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5399017930030823},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5074884295463562},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4828556180000305},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.46994641423225403},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.45214399695396423},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.4517121911048889},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.428529292345047},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3762284815311432},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3597976863384247},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.3021654188632965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28872203826904297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20026519894599915},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.17325514554977417},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.10186457633972168},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.08860939741134644},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/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/rcis.2015.7128871","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rcis.2015.7128871","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE 9th International Conference on Research Challenges in Information Science (RCIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W53241408","https://openalex.org/W1646278814","https://openalex.org/W1875120328","https://openalex.org/W1973298440","https://openalex.org/W1975009259","https://openalex.org/W1976373002","https://openalex.org/W1978478796","https://openalex.org/W1983681808","https://openalex.org/W1998839018","https://openalex.org/W2003889154","https://openalex.org/W2033629528","https://openalex.org/W2064750939","https://openalex.org/W2085533860","https://openalex.org/W2107412086","https://openalex.org/W2108730513","https://openalex.org/W2114642041","https://openalex.org/W2116020486","https://openalex.org/W2118762603","https://openalex.org/W2130130225","https://openalex.org/W2134627110","https://openalex.org/W2162675341","https://openalex.org/W2164501930","https://openalex.org/W2171643895","https://openalex.org/W2543315719","https://openalex.org/W6602174537","https://openalex.org/W6639471703"],"related_works":["https://openalex.org/W2359095153","https://openalex.org/W2227684440","https://openalex.org/W2280371997","https://openalex.org/W2376256808","https://openalex.org/W1521720839","https://openalex.org/W2156833871","https://openalex.org/W2083751087","https://openalex.org/W2349743712","https://openalex.org/W2160311168","https://openalex.org/W1770616178"],"abstract_inverted_index":{"Tree-structured":[0],"data":[1,75,91,110,132],"are":[2],"pervasively":[3],"growing":[4,24],"and":[5,63,92],"exploiting":[6,127],"them":[7],"based":[8,103],"on":[9,104],"similarity":[10,56,152],"is":[11,147],"essential":[12],"for":[13,33,54,150],"a":[14,23,37,50,80,86,98,115,124],"broad":[15],"number":[16,39],"of":[17,40,67,108,117,131,158,161],"applications.":[18],"Therefore,":[19],"there":[20],"has":[21],"been":[22],"need":[25],"to":[26,30],"develop":[27],"high-performance":[28],"techniques":[29],"efficiently":[31],"look":[32],"similar":[34],"trees":[35,162],"across":[36],"large":[38,159],"trees.":[41,133],"To":[42],"this":[43,46],"end,":[44],"in":[45,154,163],"paper,":[47],"we":[48,72],"present":[49],"new":[51,99],"sequence-based":[52],"approach":[53],"tree":[55,74,90,100],"search":[57],"that":[58,84,139],"exploits":[59],"both":[60],"the":[61,64,105,109,128],"structural":[62,106],"content":[65,129],"characteristics":[66],"tree-structured":[68],"data.":[69],"In":[70],"particular,":[71],"transform":[73],"into":[76],"sequence":[77,83,94,101],"representations":[78],"using":[79],"modified":[81],"Pr\u00fcfer":[82],"constructs":[85],"one-to-one":[87],"mapping":[88],"between":[89],"their":[93],"representations.":[95],"We":[96,121],"introduce":[97,123],"distance":[102],"information":[107,130],"tree,":[111],"which":[112],"filters":[113],"out":[114],"set":[116],"false":[118],"positive":[119],"candidates.":[120],"then":[122],"refinement":[125],"step":[126],"The":[134],"preliminarily":[135],"experimental":[136],"results":[137],"show":[138],"our":[140],"algorithm":[141],"achieves":[142],"high":[143],"performance.":[144],"Our":[145],"method":[146],"especially":[148],"suitable":[149],"accelerating":[151],"computation":[153],"clustering":[155],"and/or":[156],"classification":[157],"numbers":[160],"massive":[164],"datasets.":[165]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}