Sun Microsystems, Inc.

Modernatx, Inc.

John Reynders

Radia Joy Perlman

Guy Lewis Steele, Jr

Matthew G Stanton

Stephen G Hoge

William Joseph Issa

Edward John Miracco

Jennifer Nelson

Miriam C Kadansky

Dah Ming Chiu

Murat Yuksel

The present disclosure provides alternative nucleosides, nucleotides, and nucleic acids, and methods of using them. In some aspects, the disclosure provides mRNA wherein the uracil content has been modified and which may be particularly effective for use in therapeutic compositions, because they may benefit from both high expression levels and limited induction of the innate immune response. In some aspects, the disclosure provides methods for the production of pharmaceutical compositions including mRNA without reverse phase chromatography.

Alternative nucleic acid molecules containing reduced uracil content and uses thereof

A system and method for adding routing information for a node to a routing table, which efficiently makes necessary changes to the routing table to support routing to and from the node, while maintaining the deadlock-free quality of the paths described by the routing table. The routing table is generated by storing routing information in the routing table that reflects and describes a deadlock-free set of paths through a network of nodes. A row of entries is added to the routing table describing how to forward data units from the node. A column of entries is added to the routing table describing how to forward data units addressed to the node. The forwarding information within each entry added to the routing table maintains the deadlock-free quality of the set of paths represented by the forwarding table.

Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies

A system and method for calculating a deadlock-free free set of paths in a network generates an ordered set of deadlock-free sub-topologies, referred to as 'layers.' The ordered set of layers is then used to determine a deadlock-free set of paths through the network by performing a shortest-path route calculation with the following constraint: starting at any given layer, for each node, proceed to calculate a shortest path to every other node in the graph where, at any node being utilized to assess a given minimum path, the path may move to any higher-ordered layer, but may not return to a lower-ordered layer.

System and method for deadlock-free routing on arbitrary network topologies

Growing community of inventors

Newton, MA, United States of America

John Reynders