OpenAlex
PricingAboutJobs
Log inGet started
Work

On the border length minimization problem (BLMP) on a square array

HTML

Year: 2010
Type: conference-paper
Source: ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB)
DOI: 10.1145/1854776.1854796
Authors: Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
Language: English

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

Open Access status: closed

Funders: National Science Foundation, National Institutes of Health, National Institute of General Medical Sciences
Awards: G1291209656, Building motif lexicons
OpenAlex ID: W1980920247
FWCI: 0.296
Cites: 8
Cited by: 1
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