Abstract: Provided herein are methods and compositions for preparing nucleic acid templates wherein spatial-proximal and molecular contiguity of target nucleic acids is preserved, and the sequencing data obtained therefrom is used, but not limited to, identification of genomic variants, determination of contiguity information to inform assemblies of target nucleic acids de novo including deconvolution of haplotype phase information, and analyses of conformation and topology of target nucleic acids.

Abstract: Provided herein are methods and compositions for preparing nucleic acids in samples that preserve spatial-proximal contiguity information. Samples include, but are not limited to, formalin-fixed paraffin-embedded (FFPE) samples, deeply formalin-fixed samples and samples that comprise protein:cfDNA complexes.

Abstract: Provided herein are methods and compositions for preparing sequencing templates that provide uniform genome coverage and preserve spatial-proximal contiguity information.

Abstract: Provided herein are methods and compositions for preparing nucleic acids in samples that preserve spatial-proximal contiguity information. Samples include, but are not limited to, formalin-fixed paraffin-embedded (FFPE) samples, deeply formalin-fixed samples and samples that comprise protein:cfDNA complexes.

Abstract: The present invention relates to methods for haplotype determination and, in particular, haplotype determination at the whole genome level as well as targeted haplotype determination.

Abstract: Provided herein are methods and compositions for preparing nucleic acid templates wherein spatial-proximal and molecular contiguity of target nucleic acids is preserved, and the sequencing data obtained therefrom is used, but not limited to, identification of genomic variants, determination of contiguity information to inform assemblies of target nucleic acids de novo including deconvolution of haplotype phase information, and analyses of conformation and topology of target nucleic acids.

Abstract: The present invention relates to methods for haplotype determination and, in particular, haplotype determination at the whole genome level as well as targeted haplotype determination.

Abstract: The present invention relates to methods for haplotype determination and, in particular, haplotype determination at the whole genome level as well as targeted haplotype determination.

Abstract: Provided herein are methods and compositions for preparing nucleic acids in samples that preserve spatial-proximal contiguity information. Samples include, but are not limited to, formalin-fixed paraffin-embedded (FFPE) samples, deeply formalin-fixed samples and samples that comprise protein:cfDNA complexes.

Abstract: The present invention relates to methods for haplotype determination and, m particular, haplotype determination at the whole genome level as well as targeted haplotype determination.

Abstract: A system and computer-readable medium for designing a network are disclosed. A network is designed by a system having modules configured to perform steps that generate the network wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a threshold. The computer-readable medium stores instructions for controlling a computing device to design the network. The instructions comprise obtaining an initial network topology including links and traffic routing based on a volume of traffic, allocating a maximum delay to each link in the network topology in proportion to a square root of an imputed cost for each of the links, sizing a bandwidth required for each of the links based on a current traffic routing and at least one of a maximum delay allocated to the link, determining link lengths and rerouting traffic according to shortest paths with respect to the determined link lengths.

Abstract: A system and computer-readable medium for designing a network are disclosed. A network is designed by a system having modules configured to perform steps that generate the network wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a threshold. The computer-readable medium stores instructions for controlling a computing device to design the network. The instructions comprise obtaining an initial network topology including links and traffic routing based on a volume of traffic, allocating a maximum delay to each link in the network topology in proportion to a square root of an imputed cost for each of the links, sizing a bandwidth required for each of the links based on a current traffic routing and at least one of a maximum delay allocated to the link, determining link lengths and rerouting traffic according to shortest paths with respect to the determined link lengths.

Abstract: A system and computer-readable medium for designing a network are disclosed. A network is designed by a system having modules configured to perform steps that generate the network wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a threshold. The computer-readable medium stores instructions for controlling a computing device to design the network. The instructions comprise obtaining an initial network topology including links and traffic routing based on a volume of traffic, allocating a maximum delay to each link in the network topology in proportion to a square root of an imputed cost for each of the links, sizing a bandwidth required for each of the links based on a current traffic routing and at least one of a maximum delay allocated to the link, determining link lengths and rerouting traffic according to shortest paths with respect to the determined link lengths.

Abstract: The invention described herein includes a biodegradable weaning mat comprising a biodegradable main body.

Abstract: An apparatus and method for designing a network are disclosed. The network is designed wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a specified threshold. The method obtains an initial network topology including links and traffic routing based on a volume of traffic, allocates a maximum delay to each link in the network topology in proportion to the square root of an imputed cost for each link, sizes a bandwidth required for each link based on a current traffic routing and at least one of a maximum delay allocated to the link, determines link lengths and reroutes traffic according to shortest paths with respect to the determined link lengths.

Abstract: An apparatus and method for designing a network are disclosed. The network is designed wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a specified threshold. The method obtains an initial network topology including links and traffic routing based on a volume of traffic, allocates a maximum delay to each link in the network topology in proportion to the square root of an imputed cost for each link, sizes a bandwidth required for each link based on a current traffic routing and at least one of a maximum delay allocated to the link, determines link lengths and reroutes traffic according to shortest paths with respect to the determined link lengths.

Abstract: A method and apparatus for designing a network that supports an integrated environment for all types of applications while satisfying individual performance requirements. An initial network topology is retrieved or created, including links and traffic routing based on a volume of traffic. A maximum delay is then allocated to each link in the network topology so that the delay limits on node-to-node communication are satisfied. Further, a bandwidth required for each link is sized based on a current traffic routing as well as a maximum delay allocated to the link and total link utilization. Link lengths are then determined, based on marginal costs, and traffic is rerouted according to shortest paths with respect to the link lengths.

Abstract: A method and system are provided for computing an optimal restoration capacity and/or optimal restoration paths for a network to resolve a restoration scenario by solving a linear program (LP) model. The LP model includes decision variables corresponding to restoration capacity and restoration paths and constraints requiring restoration of traffic and conservation of capacity in the network. For example, the system determines a set of network paths that need to be restored in the network, preprocesses network data corresponding to the network to reduce LP processing workload and time; generates possible restoration paths and solves the LP model, preferably through column generation methods, to determine the optimal restoration capacity and/or the optimal restoration paths to resolve the restoration scenario; changes the LP solution into integer form, as necessary, and changes the LP solution in integer form to the original format of the network data or an equivalent thereof.