Finding Multiple Maximally Redundant Trees in Linear Time

Periodica Polytechnica Electrical Engineering
doi 10.3311/pp.ee.2010-1-2.04
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Periodica Polytechnica Budapest University of Technology and Economics

Related search

Distinguishing Trees in Linear Time

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

Finding All Maximal Perfect Haplotype Blocks in Linear Time

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2020English

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Journal of Algorithms
1998English

Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2007English

Finding Explained Groups of Time-Course Gene Expression Profiles With Predictive Clustering Trees

Molecular BioSystems
BiotechnologyMolecular Biology
2010English

Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling

1996English

Towards a Minimally Redundant Linear Predictive Vocoder

Journal of the Acoustical Society of America
AcousticsUltrasonicsArtsHumanities
1974English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Linear Time Algorithms for Finding and Representing All the Tandem Repeats in a String

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy