{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q869997","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q869997","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q869997","kernelVersion":"v1","immutable":true,"modified":"2025-07-09T17:10:26Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q869997","name":"Identifying \\(X\\)-trees with few characters","headline":"Identifying \\(X\\)-trees with few characters","description":"scientific article; zbMATH DE number 5132796","url":"https://portal.mardi4nfdi.de/entity/Q869997","datePublished":"2007-03-12","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q281903"},{"@id":"https://portal.mardi4nfdi.de/entity/Q234401"},{"@id":"https://portal.mardi4nfdi.de/entity/Q659797"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q161296"}],"comment":"Summary: Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree \\(T\\), there is a set of four characters that defines \\(T\\). Here we deal with the general case, where \\(T\\) is an arbitrary X-tree. We show that if \\(d\\) is the maximum degree of any vertex in \\(T\\), then the minimum number of characters that identify \\(T\\) is \\(\\log_2 d\\) (up to a small multiplicative constant)."},"provenance":{"prov:generatedAtTime":"2025-07-09T17:10:26Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}