「view this page in B3 βῆτα server」

Revisions №60882

branch: master 「№60882」
Commited by: Vikram K. Mulligan
GitHub commit link: 「768f9e3acc1da2cf」 「№4147」
Difference from previous tested commit:  code diff
Commit date: 2019-08-17 19:31:37

Merge pull request #4147 from RosettaCommons/vmullig/count_cycpep_unique_sequences Add an app to count the unique cyclic peptide sequences given a symmetry type, using Burnside's lemma ...Also known as the lemma that is not Burnside's. Thanks to Todd Yeates for the math for this. This app: - [x] Computes the number of unique sequences using expressions derived by Todd using Burnside's lemma. - [x] Does this for SN-symmetric sequences, too. - [x] Debug N>2. - ~~Supports problems with achiral options.~~ -> Future pull request. - [x] Optionally counts the number of unique sequences by brute force (which only works for small numbers of unique sequences). - [x] Does this for SN-symmetric sequnces, too. - [x] Supports problems with achiral options (e.g. GLY, AIB). - [x] Optionally writes out all the unique sequences (provided they're a small enough number to write out). - [x] Promote this to a public app. - [x] Documentation. - [x] Beauty. - [x] Integration test. Documentation is here: https://www.rosettacommons.org/docs/latest/application_documentation/count-cycpep-sequences

...