Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Gábor Enyedi
Finding Multiple Maximally Redundant Trees in Linear Time
Periodica Polytechnica Electrical Engineering
Related publications
Distinguishing Trees in Linear Time
Electronic Journal of Combinatorics
Combinatorics
Applied Mathematics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Finding All Maximal Perfect Haplotype Blocks in Linear Time
Algorithms for Molecular Biology
Computational Theory
Applied Mathematics
Structural Biology
Molecular Biology
Mathematics
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Journal of Algorithms
Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time
Journal of Graph Algorithms and Applications
Geometry
Computer Science Applications
Computer Science
Mathematics
Computational Theory
Theoretical Computer Science
Topology
Finding Explained Groups of Time-Course Gene Expression Profiles With Predictive Clustering Trees
Molecular BioSystems
Biotechnology
Molecular Biology
Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling
Towards a Minimally Redundant Linear Predictive Vocoder
Journal of the Acoustical Society of America
Acoustics
Ultrasonics
Arts
Humanities
Finding the K Smallest Spanning Trees
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Linear Time Algorithms for Finding and Representing All the Tandem Repeats in a String
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
