Results 21 to 30 of about 520,046 (284)
Combinatorial and Computational Investigations of Neighbor-Joining Bias
The Neighbor-Joining algorithm is a popular distance-based phylogenetic method that computes a tree metric from a dissimilarity map arising from biological data.
Ruth Davidson, Abraham Martín del Campo
doaj +1 more source
Snake Graphs Arising from Groves with an Application in Coding Theory
Snake graphs are connected planar graphs consisting of a finite sequence of adjacent tiles (squares) T1,T2,…,Tn. In this case, for 1≤j≤n−1, two consecutive tiles Tj and Tj+1 share exactly one edge, either the edge at the east (west) of Tj (Tj+1) or the ...
Agustín Moreno Cañadas +2 more
doaj +1 more source
The universal homogeneous binary tree [PDF]
25 ...
Manuel Bodirsky +3 more
openaire +3 more sources
Classifying Conserved RNA Secondary Structures With Pseudoknots by Vector-Edit Distance
Secondary structures have been proved to relate with the great functional diversity of RNA. There have been many studies to predict and compare the RNA secondary structures. However, fast and accurate comparison of RNA secondary structures with arbitrary
Liyu Huang +3 more
doaj +1 more source
Research on Key Technologies of Reconfiguration of Railway Computer Interlocking Software
The basis of computer interlocking software is the selection of data structure of interlocking software and the design of path searching algorithm. The software of the traditional computer interlocking system needs to make a lot of modifications when the
Junying CHU +5 more
doaj
Supernode Binary Search Trees [PDF]
Balanced binary search tree structures such as AVL, red-black, and splay trees store exactly one element per node. We propose supernode versions of these structures in which each node may have a large number of elements. Some properties of supernode binary search tree structures are established.
Haejae Jung, Sartaj Sahni
openaire +1 more source
Freeway Incident Frequency Analysis Based on CART Method
Classification and Regression Tree (CART), one of the most widely applied data mining techniques, is based on the classification and regression model produced by binary tree structure. Based on CART method, this paper establishes the relationship between
Xuecai Xu +2 more
doaj +1 more source
On the maximum number of period annuli for second order conservative equations
We consider a second order scalar conservative differential equation whose potential function is a Morse function with a finite number of critical points and is unbounded at infinity.
Armands Gritsans, Inara Yermachenko
doaj +1 more source
Theory exploration of binary trees [PDF]
The construction of a theory for binary trees is presented, based on the systematic exploration of the properties necessary for the proof-based synthesis and certification of sorting algorithms for binary trees. The process is computer supported, being realised in the frame of the Theorema system, with some additional proofs in Coq required for ...
Isabela Dramnesc +2 more
openaire +2 more sources
On the inducibility of small trees [PDF]
The quantity that captures the asymptotic value of the maximum number of appearances of a given topological tree (a rooted tree with no vertices of outdegree $1$) $S$ with $k$ leaves in an arbitrary tree with sufficiently large number of leaves is called
Dossou-Olory, Audace A. V. +1 more
core +2 more sources

