Reconstructing the shape of a tree from observed dissimilarity data
Advances in Applied Mathematics
Kaikoura tree theorems: computing the maximum agreement subtree
Information Processing Letters
On the agreement of many trees
Information Processing Letters
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
SIAM Journal on Computing
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Rooted Maximum Agreement Supertrees
Algorithmica
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Encyclopedia of Algorithms
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
RIATA-HGT: a fast and accurate heuristic for reconstructing horizontal gene transfer
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Parameterized Complexity
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Fixed-Parameter algorithms for finding agreement supertrees
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
| Hi-index | 0.00 |
HASH(0x295276c)