Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Bipartition Utils #1

Open
daviddao opened this issue Apr 29, 2015 · 2 comments
Open

Bipartition Utils #1

daviddao opened this issue Apr 29, 2015 · 2 comments

Comments

@daviddao
Copy link

Bipartitions are very important representations to analyse tree topologies. Maybe we can create a Bipartition Utils containing

  • extraction algorithms
  • efficient bipartition representations (Sparse BitVector Format or a Compressed BitVector Format)
  • distance functions
@lczech
Copy link
Owner

lczech commented Apr 30, 2015

There is a very small Bipartition class in ./lib/tree/, which can extract Bipartitions so far. In the future, we should build in your ideas, I agree.

@lczech
Copy link
Owner

lczech commented May 4, 2015

As for the different ways of representing bit-information (naive, sparse, compressed, ...), a software engineer way would be to write an interface class and derive the implementations from that. This way, you can plug in whatever you need.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants