Classes of treebased networks
Recently, so-called treebased phylogenetic networks have gained considerable interest in the literature, where a treebased network is a network that can be constructed from a phylogenetic tree, called the base tree, by adding additional edges. The main aim of this manuscript is to provide some sufficient criteria for treebasedness by reducing phylogenetic networks to related graph structures. While it is generally known that deciding whether a network is treebased is NP-complete, one of these criteria, namely edgebasedness, can be verified in linear time. Surprisingly, the class of edgebased networks is closely related to a well-known family of graphs, namely the class of generalized series parallel graphs, and we will explore this relationship in full detail. Additionally, we introduce further classes of treebased networks and analyze their relationships.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Decision Trees for Intuitive Intraday Trading Strategies
This research paper aims to investigate the efficacy of decision trees in constructing intraday trading strategies using existing technical indicators for individual equities in the NIFTY50 index. Unlike conventional met…
Neural Tree Indexers for Text Understanding
Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the composit…
Natural Language InferenceSentenceSentence ClassificationEnhancing octree-based context models for point cloud geometry compression with attention-based child node number prediction
In point cloud geometry compression, most octreebased context models use the cross-entropy between the onehot encoding of node occupancy and the probability distribution predicted by the context model as the loss. This a…
Use of unsupervised word classes for entity recognition: Application to the detection of disorders in clinical reports
Unsupervised word classes induced from unannotated text corpora are increasingly used to help tasks addressed by supervised classification, such as standard named entity detection. This paper studies the contribution of …
ChunkingClusteringNamed Entity Recognition (NER)Word EmbeddingsBounding Embeddings of VC Classes into Maximum Classes
One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. T…
Learning Theory