Shortcuts, diversions, and maximal chainsin partially ordered sets

✍ Scribed by David Sankoff; Peter H. Sellers

• Publisher: Elsevier Science
• Year: 1973
• Tongue: English
• Weight: 308 KB
• Volume: 4
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/s0012-365x(73)80007-x

✦ Synopsis

An algorithm is described for finding the maximal weight chain between two points in a locally finite partial order under the restriction that all but • (or fewer) successive pairs in the chain belong to a given subset of the partial order relation. Applications of the method in molecular genetics, critical path scheduling, and other fields are discussed.