Given module definitions and reaction information based on a KEGG database, modDFS does a depth first search to find whether a set of KOs are sufficient for completion of a module. For cases where only 1 absent KO would've been enough for module completion, that module is reported to be complete(only lenient). For cyclic modules, completion is defined as having all the module reaction steps present. Again, lenient completion cases are reported. Also, all absent reactions are reported so that a manual inspection of completion can be done for modules that are parially cyclic.

Project Activity

See All Activity >

Categories

Bio-Informatics

License

Creative Commons Attribution Non-Commercial License V2.0

Follow modDFS

modDFS Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of modDFS!

Additional Project Details

User Interface

Command-line

Programming Language

Perl

Database Environment

ADO.NET

Related Categories

Perl Bio-Informatics Software

Registered

2013-03-12