Abstract: Techniques for assembly of genetic maps including de novo assembly of distance maps using multiple alignment consensus construction. Multiple map alignment can be performed on a defined bundle of fragment maps corresponding to biomolecule fragments to determine consensus events and corresponding locations. Fragment maps in the bundle can be removed when there is no overhang from the consensus events. When the subset of fragment maps in the bundle is less than a predetermined threshold, one or more additional fragment maps can be added based on fragment signatures, a consensus alignment score, and a pairwise alignment score. Techniques for multiple alignment can include generating a graph with edges and vertices representing each pairwise relation. An ordered set of sets of events best representing a multiple alignment reflecting all pairwise alignments can be generated by repeatedly randomly removing edges and combining vertices to identify a min cut of the graph.

Abstract: Techniques for assembly of genetic maps including de novo assembly of distance maps using multiple alignment consensus construction. Multiple map alignment can be performed on a defined bundle of fragment maps corresponding to biomolecule fragments to determine consensus events and corresponding locations. Fragment maps in the bundle can be removed when there is no overhang from the consensus events. When the subset of fragment maps in the bundle is less than a predetermined threshold, one or more additional fragment maps can be added based on fragment signatures, a consensus alignment score, and a pairwise alignment score. Techniques for multiple alignment can include generating a graph with edges and vertices representing each pairwise relation. An ordered set of sets of events best representing a multiple alignment reflecting all pairwise alignments can be generated by repeatedly randomly removing edges and combining vertices to identify a min cut of the graph.

Abstract: A method for determining a sequence of a biomolecule, the method including binding a plurality of uniform probes to a biomolecule fragment, creating a collection of binding signatures for the fragment with each binding signature representing a series of distances between binding sites within the fragment, and grouping the binding signatures into a plurality of signature clusters based at least in part on distances between the binding sites in each binding signature. For each binding signature in a first cluster, a potential successor binding signature is selected from signature clusters other than the first signature cluster, and one of the potential successor binding signatures is identified as a successor binding signature. The last two steps are repeated until the successor signature represents a terminal signature, resulting in a sequence of signatures representing at least a portion of the biomolecule.

Abstract: A method for determining a sequence of a biomolecule, the method including binding a plurality of uniform probes to a biomolecule fragment, creating a collection of binding signatures for the fragment with each binding signature representing a series of distances between binding sites within the fragment, and grouping the binding signatures into a plurality of signature clusters based at least in part on distances between the binding sites in each binding signature. For each binding signature in a first cluster, a potential successor binding signature is selected from signature clusters other than the first signature cluster, and one of the potential successor binding signatures is identified as a successor binding signature. The last two steps are repeated until the successor signature represents a terminal signature, resulting in a sequence of signatures representing at least a portion of the biomolecule.

Abstract: Embodiments of methods, apparatuses, devices and systems associated with sorting candidate values are disclosed.

Abstract: Disclosed is is a switch-based network interconnection which uses intelligent switching apparatus devices for improving the performance and connection establishing capability of multi-stage switching networks. The invention method is particularly effective In asynchronous circuit-switched networks. The most important feature of the invention methodology is the an increasing probability for the success of making a connection through all the stages of a multi-satge network. As a connection progresses through a multi-stage network, it must win successive stages of the network, one at a time, until it has made its way from on side of the network to the other and established the commanded source-to-destination connection. The uniqueness in the present invention is that as the connection at each stage of the network is established, looking forward to the next stage, the probability will be greater of establishing the next connection without encountering blocking than it was for the present stage.

Abstract: A multi-stage circuit switched network for improving connection establishment using intelligent switching devices. As a transmission makes its way through the network stages, the probability of connecting to a destination increases, i.e., the chance of encountering a blocked device output is decreased. This is opposite of most traditional networks, whose probability for success diminishes with every stage in the connection sequence.

Abstract: Disclosed is a method and apparatus for improving the performance and connection establishing capability of multi-stage switching networks by providing additional intelligent features in the individual switching apparatus devices at each stage of the network. The invention method is particularly effective in asynchronous circuit-switched networks. The most important feature to be added is adaptivity of the switching apparatus; where adaptivity means the ability of each switching element to determine for itself which of several optional alternate paths to try at each stage of the network based on availability. This is a better approach because it brings the decision directly to the switching apparatus involved, which has the data required to make an intelligent path selection decision to circumvent blocking in the multi-stage network.