{"id":"https://openalex.org/W7095549865","doi":null,"title":"Characterization of the Distance between Subtrees of a Tree by the Associated Tight Span","display_name":"Characterization of the Distance between Subtrees of a Tree by the Associated Tight Span","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W7095549865"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.605.5452","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.605.5452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ism.ac.jp/~tsuchiya/sympo/shukai04/shukai04-papers/317hirai.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.49286988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.22439999878406525,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.22439999878406525,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.07919999957084656,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.07280000299215317,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-metrics","display_name":"tree metrics","score":0.7820000052452087},{"id":"https://openalex.org/keywords/tight-span","display_name":"tight span","score":0.9440000057220459},{"id":"https://openalex.org/keywords/subtrees","display_name":"subtrees","score":0.6420000195503235},{"id":"https://openalex.org/keywords/metric-geometry","display_name":"metric geometry","score":0.4259999990463257},{"id":"https://openalex.org/keywords/shortest-path-length","display_name":"shortest path length","score":0.5260000228881836}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8185999989509583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6958000063896179},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6880000233650208},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5950999855995178},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.5767999887466431},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43619999289512634},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4016999900341034},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.3666999936103821},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2752000093460083},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2720000147819519}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.605.5452","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.605.5452","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ism.ac.jp/~tsuchiya/sympo/shukai04/shukai04-papers/317hirai.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/W7095748791","https://openalex.org/W4413162512","https://openalex.org/W3011097342","https://openalex.org/W2082445660","https://openalex.org/W3021606076","https://openalex.org/W2008285375","https://openalex.org/W2041571997","https://openalex.org/W7223054154","https://openalex.org/W2963803072","https://openalex.org/W1994735558"],"abstract_inverted_index":{"A":[0],"characterization":[1],"is":[2,21,55,66],"given":[3],"to":[4],"the":[5,14,25,35,38,46],"distance":[6],"between":[7,18],"subtrees":[8],"of":[9,24,37,45],"a":[10,22,53,56,67],"tree":[11,29,57],"defined":[12],"as":[13],"shortest":[15],"path":[16],"length":[17],"subtrees.":[19],"This":[20],"generalization":[23],"four-point":[26],"condition":[27],"for":[28],"metrics.":[30],"For":[31],"this,":[32],"we":[33],"use":[34],"theory":[36],"tight":[39,64],"span":[40,65],"and":[41,60],"obtain":[42],"an":[43],"extension":[44],"famous":[47],"result":[48],"by":[49],"A.":[50],"Dress":[51],"that":[52],"metric":[54,58],"if":[59,62],"only":[61],"its":[63],"tree.":[68],"1":[69]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-27T00:00:00"}