Relevant bibliographies by topics / Subtree

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Subtree'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Subtree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Subtree"

1

Yang, Yu, Long Li, Wenhu Wang, and Hua Wang. "On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs." Mathematics 9, no. 1 (2020): 36. http://dx.doi.org/10.3390/math9010036.

Full text
Abstract:
The BC-subtree (a subtree in which any two leaves are at even distance apart) number index is the total number of non-empty BC-subtrees of a graph, and is defined as a counting-based topological index that incorporates the leaf distance constraint. In this paper, we provide recursive formulas for computing the BC-subtree generating functions of multi-fan and multi-wheel graphs. As an application, we obtain the BC-subtree numbers of multi-fan graphs, r multi-fan graphs, multi-wheel (wheel) graphs, and discuss the change of the BC-subtree numbers between different multi-fan or multi-wheel graphs
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Yu, An Wang, Hua Wang, Wei-Ting Zhao, and Dao-Qiang Sun. "On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution." Mathematics 7, no. 5 (2019): 472. http://dx.doi.org/10.3390/math7050472.

Full text
Abstract:
The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction. Motivated from the study of graph surgeries on evolutionary dynamics, we consider the subtree problems of fan graphs, wheel graphs, and the class of graphs obtained from “partitioning” wheel graphs under dynamic evolution. The enumeration of these subtree numbers is done through the so-called subtree generation functions of graphs. With the enumerative result, we briefly explore the extremal
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Yangjun, and Dunren Che. "Efficient Processing of XML Tree Pattern Queries." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 5 (2006): 738–43. http://dx.doi.org/10.20965/jaciii.2006.p0738.

Full text
Abstract:
In this paper, we present a polynomial-time algorithm for TPQ (tree pattern queries) minimization without XML constraints involved. The main idea of the algorithm is a dynamic programming strategy to find all the matching subtrees within a TPQ. A matching subtree implies a redundancy and should be removed in such a way that the semantics of the original TPQ is not damaged. Our algorithm consists of two parts: one for subtree recognization and the other for subtree deletion. Both of them needs only O(<I>n</I>2) time, where <I>n</I> is the number of nodes in a TPQ.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Long, Zongpu Jia, Yu Yang, Fengge Duan, Hailian Lv, and Weiting Zhao. "Enumerating Subtrees of Flower and Sunflower Networks." Symmetry 15, no. 2 (2023): 284. http://dx.doi.org/10.3390/sym15020284.

Full text
Abstract:
Symmetry widely exists in many complex and real-world networks, with flower networks and sunflower networks being two richly symmetric networks and having many practical applications due to their special structures. The number of subtrees (the subtree number index) is closely related to the reliable network design. Using a generating function, structural analysis techniques, and auxiliary structure introduction, this paper presents the subtree generating functions of flower networks Fln,m(n≥3,m≥2) and sunflower networks Sfn,m(n≥3,m≥2) and, thus, solves the computation of subtree number indices
APA, Harvard, Vancouver, ISO, and other styles
5

Chiswell, I. M. "Minimal group actions on Λ-trees". Proceedings of the Royal Society of Edinburgh: Section A Mathematics 128, № 1 (1998): 23–36. http://dx.doi.org/10.1017/s030821050002713x.

Full text
Abstract:
We consider the existence and uniqueness of minimal invariant subtrees for abelian actions of groups on Λ-trees, and whether or not a minimal action is determined up to isomorphism by the hyperbolic length function. The main emphasis is on actions of end type. For a trivial action of end type, there is no minimal invariant subtree. However, if a finitely generated group has an action of end type, the action is nontrivial and there is a unique minimal invariant subtree. There are examples of infinitely generated groups with a nontrivial action of end type for which there is no minimal invariant
APA, Harvard, Vancouver, ISO, and other styles
6

Bartha, Dénes. "Reconstruction of Rooted Directed Trees." Acta Cybernetica 24, no. 2 (2019): 249–62. http://dx.doi.org/10.14232/actacyb.24.2.2019.5.

Full text
Abstract:
Let T be a rooted directed tree on n vertices, rooted at v. The rooted subtree frequency vector (RSTF-vector) of T with root v, denoted by rstf(T, v) is a vector of length n whose entry at position k is the number of subtrees of T that contain v and have exactly k vertices. In this paper we present an algorithm for reconstructing rooted directed trees from their rooted subtree frequencies (up to isomorphism). We show that there are examples of nonisomorphic pairs of rooted directed trees that are RSTF-equivalent, s.t. they share the same rooted subtree frequency vectors. We have found all such
APA, Harvard, Vancouver, ISO, and other styles
7

Ma, Hai Tao, Chang Yong Yu, Chang Ming Xu, and Miao Fang. "Efficiently Subtree Matching between XML and Probabilistic XML Documents." Applied Mechanics and Materials 571-572 (June 2014): 575–79. http://dx.doi.org/10.4028/www.scientific.net/amm.571-572.575.

Full text
Abstract:
We explored the subtree matching problem of probabilistic XML documents: finding the matches of an XML query tree over a probabilistic XML document, using the canonical tree edit distance as a similarity measure between subtrees. Probabilistic XML is a probability distribution model capturing uncertainty of both value and structure. Query over probabilistic XML documents is difficult: an naivie algorithm has exponential complexity by directly compute the tree edit distance between the query tree and each certain XML tree represented by the probabilistic XML document. Based on the method of tre
APA, Harvard, Vancouver, ISO, and other styles
8

Rockett, Peter. "Pruning of genetic programming trees using permutation tests." Evolutionary Intelligence 13, no. 4 (2020): 649–61. http://dx.doi.org/10.1007/s12065-020-00379-8.

Full text
Abstract:
Abstract We present a novel approach based on statistical permutation tests for pruning redundant subtrees from genetic programming (GP) trees that allows us to explore the extent of effective redundancy . We observe that over a range of regression problems, median tree sizes are reduced by around 20% largely independent of test function, and that while some large subtrees are removed, the median pruned subtree comprises just three nodes; most take the form of an exact algebraic simplification. Our statistically-based pruning technique has allowed us to explore the hypothesis that a given subt
APA, Harvard, Vancouver, ISO, and other styles
9

Lei, Xiang Xin, Shun Liang Cao, Shao Yin Huang, and Jian Guo Yang. "PTList: Mining XML Data Stream Using Paging Schema." Advanced Materials Research 403-408 (November 2011): 1888–91. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.1888.

Full text
Abstract:
Aiming at unlimited growing XML data stream and large XML document, we present PTList, mining frequent subtrees in XML using paging schema. PTList pages XML data stream, manages cross-page nodes and frequent candidate subtrees growing across page, mines frequent subtrees page-by-page, selects frequent subtree according to the page minimum support, and prunes branches based on the decaying factor. PTList mines XML data stream in the limit of the error of support, improves the memory utilization, and speeds up the mining process.
APA, Harvard, Vancouver, ISO, and other styles
10

Nguyễn Xuân Dũng, Dũng, та Hùng Vi Mạnh Hùng. "NGHIÊN CỨU VỀ THUẬT TOÁN KHAI PHÁ CÂY CON PHỔ BIẾN TRONG KHO CÁC CÂY DỮ LIỆU". Tạp chí Khoa học Trường Đại học Trưng Vương 1, № 1 (2025): 89–94. https://doi.org/10.64223/tvj.p2025.v1.i1.a11.

Full text
Abstract:
Important issue in mining database of trees is to find frequent occurs of subtrees. Since the number of frequent subtrees usually grows exponentially with the size of subtrees, therefore mining all frequent subtrees become infeasible for large tree size with traditional methods. There are several techniques which are used to prune the branches of enumeration tree that do not correspond to frequent subtrees. One of these techniques is heuristic method which is used to compute and identify frequent subtrees. In this paper, we present the canonical form for labelled rooted unordered trees the bre
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Subtree"

1

Atkins, Ross. "Subtree transfer operations on phylogenetic networks." Thesis, University of Oxford, 2016. http://ora.ox.ac.uk/objects/uuid:61dcd8e3-8e1d-4678-b22f-b6d77341aacf.

Full text
Abstract:
Leaf-labelled, rooted binary trees can be used to represent a wide range of data. One way to measure the discrepancy between a pair of such trees, is to measure how many subtree transfer operations are required to transform one into the other. Four standard subtree transfer oper- ations for binary trees, used in particular for leaf-labelled binary trees, are: tree bisection and reconnection (TBR), subtree prune and regraft (rSPR), rooted subtree prune and regraft (rSPR) and nearest neighbour interchange (NNI). Each of these operations induces a metric over the class, B(n), of binary trees with
APA, Harvard, Vancouver, ISO, and other styles
2

Welke, Pascal [Verfasser]. "Efficient Frequent Subtree Mining Beyond Forests / Pascal Welke." Bonn : Universitäts- und Landesbibliothek Bonn, 2019. http://d-nb.info/1188732161/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cenek, Eowyn W. "Subtree overlap graphs and the maximum independent set problem." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ28923.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Allen, Benjamin L. "Subtree transfer operations and their induced metrics on evolutionary trees." Thesis, University of Canterbury. Mathematics, 1998. http://hdl.handle.net/10092/8409.

Full text
Abstract:
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology. In this setting, extant species label the leaves of the tree, while the internal vertices correspond to ancestral species. Various techniques exist for reconstructing these evolutionary trees from data, and an important problem is to determine how "far apart" two such reconstructed trees are from each other, or indeed from the true historical tree. To investigate this question requires tree metrics, and these can be induced by operations that rearrange trees locally. Here we investigate three s
APA, Harvard, Vancouver, ISO, and other styles
5

Shen, Mo. "Exploiting Vocabulary, Morphological, and Subtree Knowledge to Improve Chinese Syntactic Analysis." 京都大学 (Kyoto University), 2016. http://hdl.handle.net/2433/215675.

Full text
Abstract:
In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of Kyoto University's products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink.<br>Kyoto University (京都大学)<br>0048<br>新制・課程博士<br>博士(情報学)<br>甲第198
APA, Harvard, Vancouver, ISO, and other styles
6

Hesselius, Tobias, and Tommy Savela. "A Java Framework for Broadcast Encryption Algorithms." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2504.

Full text
Abstract:
<p>Broadcast encryption is a fairly new area in cryptology. It was first addressed in 1992, and the research in this area has been large ever since. In short, broadcast encryption is used for efficient and secure broadcasting to an authorized group of users. This group can change dynamically, and in some cases only one-way communication between the sender and receivers is available. An example of this is digital TV transmissions via satellite, in which only the paying customers can decrypt and view the broadcast. </p><p>The purpose of this thesis is to develop a general Java framework for impl
APA, Harvard, Vancouver, ISO, and other styles
7

Collins, Joshua Stewart. "Rekernelisation Algorithms in Hybrid Phylogenies." Thesis, University of Canterbury. Mathematics and Statistics, 2009. http://hdl.handle.net/10092/2852.

Full text
Abstract:
It has become well known that an evolutionary tree is inadequate to represent fully the history of life. Two possible ways of dealing with this are the rooted subtree prune and regraft distance between a pair of trees, which measures how different they are, and the slightly more biologically sound hybridisation number of a set of trees that attempts to determine the minimum number of hybrid events that must have occurred for a given set of evolutionary trees. When characterised via agreement forests both problems are, although NP hard, fixed parameter tractable---meaning the problem can be con
APA, Harvard, Vancouver, ISO, and other styles
8

Snook, Michael James. "Evolution of Tandemly Repeated Sequences." Thesis, University of Canterbury. Mathematics & Statistics, 2009. http://hdl.handle.net/10092/2661.

Full text
Abstract:
Despite being found in all presently sequenced genomes, the evolution of tandemly repeated sequences has only just begun to be understood. We can represent the duplication history of tandemly repeated sequences with duplication trees. Most phylogenetic techniques need to be modified to be used on duplication trees. Due to gene loss, it is not always possible to reconstruct the duplication history of a tandemly repeated sequence. This thesis addresses this problem by providing a polynomial-time locally optimal algorithm to reconstruct the duplication history of a tandemly repeated sequence in
APA, Harvard, Vancouver, ISO, and other styles
9

Kutty, Sangeetha. "Enriching XML documents clustering by using concise structure and content." Thesis, Queensland University of Technology, 2011. https://eprints.qut.edu.au/48326/1/Sangeetha_Kutty_Thesis.pdf.

Full text
Abstract:
With the growing number of XML documents on theWeb it becomes essential to effectively organise these XML documents in order to retrieve useful information from them. A possible solution is to apply clustering on the XML documents to discover knowledge that promotes effective data management, information retrieval and query processing. However, many issues arise in discovering knowledge from these types of semi-structured documents due to their heterogeneity and structural irregularity. Most of the existing research on clustering techniques focuses only on one feature of the XML documents, thi
APA, Harvard, Vancouver, ISO, and other styles
10

Chowdhury, Israt Jahan. "Knowledge discovery from tree databases using balanced optimal search." Thesis, Queensland University of Technology, 2016. https://eprints.qut.edu.au/92263/1/Israt%20Jahan_Chowdhury_Thesis.pdf.

Full text
Abstract:
This research is a step forward in discovering knowledge from databases of complex structure like tree or graph. Several data mining algorithms are developed based on a novel representation called Balanced Optimal Search for extracting implicit, unknown and potentially useful information like patterns, similarities and various relationships from tree data, which are also proved to be advantageous in analysing big data. This thesis focuses on analysing unordered tree data, which is robust to data inconsistency, irregularity and swift information changes, hence, in the era of big data it becomes
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Subtree"

1

United States. National Aeronautics and Space Administration., ed. Reconfigurable tree architectures using subtree oriented fault tolerance. Coordinated Science Laboratory, College of Engineering, University of Illinois at Urbana-Champaign, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ian, Monk, and Monk Ian, eds. Impermanence subtile: Subtle impermanence. Imprimè á l'atelier Vincent, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mead, George Robert Stow. Die Lehre vom feinstofflichen Ko rper in der westlichen Tradition: Geistko rper, Strahlenko rper und Auferstehungsko rper in der Erfahrungswelt der Pythagora er, Neuplatoniker, Gnostiker und Hermetischen Philosophen. Ansata-Verlag, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Davidson, John. Subtle energy. C.W. Daniel Co. Ltd, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Thomas, Wanda Y. Subtle secrets. 2nd ed. Genesis Press, Inc., 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Parry, Raymond. Subtle tranquillity. Aramby Booklet Publications, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Miller, Wayne H. Subtle deceivers. Hiram Charles Pub., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Copyright Paperback Collection (Library of Congress), ed. Subtle secrets. Genesis Press, Inc., 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rush, Norman. Subtle bodies. Granta, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Salocher, Peter. Enertree: Heilung durch die Energie der Ba ume. Droemer Knaur, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Subtree"

1

Van Belle, Terry, and David H. Ackley. "Uniform Subtree Mutation." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45984-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Carlson, Josiah, and David Eppstein. "The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems." In Algorithm Theory – SWAT 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11785293_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Welke, Pascal, Tamás Horváth, and Stefan Wrobel. "Probabilistic Frequent Subtree Kernels." In New Frontiers in Mining Complex Patterns. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-39315-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Wenliang, and Min Zhang. "Training with Subtree Structures." In Semi-Supervised Dependency Parsing. Springer Singapore, 2015. http://dx.doi.org/10.1007/978-981-287-552-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pinter, Ron Y., Oleg Rokhlenko, Dekel Tsur, and Michal Ziv-Ukelson. "Approximate Labelled Subtree Homeomorphism." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27801-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gössel, M., and B. Rebel. "Memories for parallel subtree-access." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18099-0_37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Angeline, Peter J. "Comparing subtree crossover with macromutation." In Evolutionary Programming VI. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0014804.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gavril, Fanica. "Algorithms on Subtree Filament Graphs." In Graph Theory, Computational Intelligence and Thought. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02029-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Winter, Anita. "Algebraic measure trees: Statistics based on sample subtree shapes and sample subtree masses." In Probabilistic Structures in Evolution. European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/ecr/17-1/21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Creutzburg, Reiner. "Parallel linear conflict-tree subtree access." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18099-0_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Subtree"

1

Kumar, Abhishek, Sarfaroz Yunusov, and Ali Emami. "Subtle Biases Need Subtler Measures: Dual Metrics for Evaluating Representative and Affinity Bias in Large Language Models." In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-long.23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chong Zhou, Lei Zou, Rong Hu, et al. "Mining Frequent Induced Subtree Patterns with Subtree-Constraint." In 2006 6th IEEE International Conference on Data Mining Workshops. IEEE, 2006. http://dx.doi.org/10.1109/icdmw.2006.112.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Abboud, Amir, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, and Or Zamir. "Subtree Isomorphism Revisited." In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

de Lhoneux, Miryam, Miguel Ballesteros, and Joakim Nivre. "Recursive Subtree Composition in." In Proceedings of the 2019 Conference of the North. Association for Computational Linguistics, 2019. http://dx.doi.org/10.18653/v1/n19-1159.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Biswas, Partha, and Girish Venkataramani. "Comprehensive isomorphic subtree enumeration." In the 2008 international conference. ACM Press, 2008. http://dx.doi.org/10.1145/1450095.1450122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Muntean, Oana, Laura Diosan, and Mihai Oltean. "Best SubTree genetic programming." In the 9th annual conference. ACM Press, 2007. http://dx.doi.org/10.1145/1276958.1277287.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Tao. "Frequent Subtree Based Indexing." In 2007 International Conference on Wireless Communications, Networking and Mobile Computing. IEEE, 2007. http://dx.doi.org/10.1109/wicom.2007.1364.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Han, Kun, Weifeng Lv, Baocai Yin, and Yongli Hu. "Constrained Frequent Subtree Mining Method." In 2014 5th International Conference on Digital Home (ICDH). IEEE, 2014. http://dx.doi.org/10.1109/icdh.2014.62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Flouri, Tomas, Borivoj Melichar, and J. Janousek. "Subtree matching by deterministic pushdown automata." In 2009 International Multiconference on Computer Science and Information Technology (IMCSIT). IEEE, 2009. http://dx.doi.org/10.1109/imcsit.2009.5352769.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Augsten, Nikolaus, Denilson Barbosa, Michael Bohlen, and Themis Palpanas. "TASM: Top-k Approximate Subtree Matching." In 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icde.2010.5447905.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Subtree"

1

Kille, S. Representing Tables and Subtrees in the X.500 Directory. RFC Editor, 1995. http://dx.doi.org/10.17487/rfc1837.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kille, S. Representing Tables and Subtrees in the X.500 Directory. RFC Editor, 1998. http://dx.doi.org/10.17487/rfc2293.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liskov, Barbara, and Jeannette M. Wing. A New Definition of the Subtype Relation. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada265548.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hewett, Kate J., Ian P. Curry, Edna Rath, and Stephanie M. Collins. Subtle Cognitive Effects of Moderate Hypoxia. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada511511.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liebman, Jeffrey, and Richard Zeckhauser. Simple Humans, Complex Insurance, Subtle Subsidies. National Bureau of Economic Research, 2008. http://dx.doi.org/10.3386/w14330.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lilly, B. Media Subtype Registration for Media Type text/troff. RFC Editor, 2006. http://dx.doi.org/10.17487/rfc4263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cridland, D. The Internet Assigned Number Authority (IANA) Application Configuration Access Protocol (ACAP) Vendor Subtrees Registry. RFC Editor, 2010. http://dx.doi.org/10.17487/rfc6075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vogt, Brent A. Receptor Subtype Alterations: Bases of Neuronal Plasticity and Learning. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada232655.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yanco, Holly A., Hadas Kress-Gazit, Holly Yanco, et al. SUBTLE: Situation Understanding Bot through Language and Environment. Defense Technical Information Center, 2016. http://dx.doi.org/10.21236/ad1006698.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nakshatri, Harikrishna, and Kasi R. McCune. Can Diabetes Change the Intrinsic Subtype Specificity of Breast Cancer? Defense Technical Information Center, 2008. http://dx.doi.org/10.21236/ada492747.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Subtree' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography