Abstract
We present the design and validation of an example-based pathway graph query algebra and visual proximity rules to address challenging large biological pathway exploration tasks. Our pathway graph query algebra interprets relationship queries given by selected examples to find a match for, extract identical parts between, or trace a path from any pathway components. To support the relationship query, users can composite pathway visualizations through visual proximity rules that use proximity to infer users’ intentions in the exploration process. By allowing selection of one or more objects from multiple on-screen grouped graphs as query inputs and using the query outputs as next-query inputs, pathway graph query algebra and visual proximity rules achieve intuitiveness, concurrence, and dynamics for pathway exploration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
