[图书][B] Algorithms on trees and graphs
G Valiente - 2002 - Springer
The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …
Tanglegrams for rooted phylogenetic trees and networks
C Scornavacca, F Zickmann, DH Huson - Bioinformatics, 2011 - academic.oup.com
Motivation: In systematic biology, one is often faced with the task of comparing different
phylogenetic trees, in particular in multi-gene analysis or cospeciation studies. One …
phylogenetic trees, in particular in multi-gene analysis or cospeciation studies. One …
Introduction to RNA secondary structure comparison
S Schirmer, Y Ponty, R Giegerich - RNA Sequence, Structure, and …, 2014 - Springer
Many methods have been proposed for RNA secondary structure comparison, and new
ones are still being developed. In this chapter, we first consider structure representations …
ones are still being developed. In this chapter, we first consider structure representations …
Tanglegrams: a reduction tool for mathematical phylogenetics
Many discrete mathematics problems in phylogenetics are defined in terms of the relative
labeling of pairs of leaf-labeled trees. These relative labelings are naturally formalized as …
labeling of pairs of leaf-labeled trees. These relative labelings are naturally formalized as …
Comparing trees via crossing minimization
H Fernau, M Kaufmann, M Poths - Journal of Computer and System …, 2010 - Elsevier
We consider the following problem (and variants thereof) that has important applications in
the construction and evaluation of phylogenetic trees: Two rooted unordered binary trees …
the construction and evaluation of phylogenetic trees: Two rooted unordered binary trees …
Tree isomorphism
G Valiente, G Valiente - algorithms on trees and graphs, 2002 - Springer
Tree identification is the problem of determining whether two trees are isomorphic, and it is a
fundamental problem with a variety of interesting applications in diverse scientific and …
fundamental problem with a variety of interesting applications in diverse scientific and …
Forest alignment with affine gaps and anchors, applied in RNA structure comparison
S Schirmer, R Giegerich - Theoretical Computer Science, 2013 - Elsevier
We present two enhancements to Jiang's tree alignment algorithm, motivated by experience
with its use for RNA structure alignment. One enhancement is the introduction of an affine …
with its use for RNA structure alignment. One enhancement is the introduction of an affine …
[HTML][HTML] Algorithms for topology-free and alignment network queries
In this article we address two pattern matching problems which have important applications
to bioinformatics. First we address the topology-free network query problem: Given a set of …
to bioinformatics. First we address the topology-free network query problem: Given a set of …
Forest alignment with affine gaps and anchors
S Schirmer, R Giegerich - … Matching: 22nd Annual Symposium, CPM 2011 …, 2011 - Springer
We present two enhancements to Jiang's tree alignment algorithm, motivated by experience
with its use for RNA structure alignment. One enhancement is the introduction of an affine …
with its use for RNA structure alignment. One enhancement is the introduction of an affine …
Searching for optimal caterpillars in general and bounded treewidth graphs
M Khosravani Moghadam - 2011 - researchspace.auckland.ac.nz
In this thesis we are interested in optimization problems on caterpillar trees. A caterpillar is a
tree with this property that if one removes its leaves only a path is left. The majority of this …
tree with this property that if one removes its leaves only a path is left. The majority of this …