Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics

doi 10.5772/13245
Full Text
Abstract

Available in full text

Date
Authors
Publisher

InTech

Related search

Approximation Algorithms for Finding Maximum Induced Expanders

2017English

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

Journal of Algorithms
1993English

Bioinformatics Tools for Cancer Metabolomics

Metabolomics
BiochemistryEndocrinologyClinical BiochemistryMetabolismDiabetes
2011English

An Efficient Algorithm for Finding the Maximal Eigenvalue of Zero Symmetric Nonnegative Matrices

Mathematical Problems in Engineering
MathematicsEngineering
2018English

Algorithm for Finding Maximal Frequent Sets

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Approximate Proximal Point Algorithms for Finding Zeroes of Maximal Monotone Operators in Hilbert Spaces

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2008English

Enumerating Maximal Cliques in Link Streams With Durations

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2018English

New Tools and Simpler Algorithms for Branchwidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy