Algorithms for computing lengths of chains in integral partition lattices.

DOI10.1016/S0304-3975(01)00392-9zbMath1061.68078MaRDI QIDQ1853557

Honghui Wan, John C. Wootton

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Lattices (06B99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of tournaments with prescribed score vector
• On nearly self-conjugate partitions of a finite set
• Non-globular domains in protein sequences: Automated segmentation using complexity measures
• Statistics of local complexity in amino acid sequences and sequence databases
• A global compositional complexity measure for biological sequences: AT-rich and GC-rich genomes encode less complex proteins

This page was built for publication: Algorithms for computing lengths of chains in integral partition lattices.