OpenAlex
PricingAboutJobs
Log inGet started
Work

Finding Maximum Colorful Subtrees in Practice

HTML

Year: 2013
Type: article
Source: Journal of Computational Biology
DOI: 10.1089/cmb.2012.0083
Authors: Imran Rauf, Florian Rasche, François Nicolas, Sebastian Böcker
Institutions: National University of Computer and Emerging Sciences, Friedrich Schiller University Jena
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences

Open Access status: closed

Funder: University of Connecticut
OpenAlex ID: W2173552987
FWCI: 5.39
Cites: 18
Cited by: 31
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms