Entity

Time filter

Source Type

Providence, RI, United States

Patent
Nabsys Inc. | Date: 2014-03-06

Assay methods and apparatus for the analysis of biopolymers are disclosed. The assays employ nicking endonucleases to enable the generation of flaps on target biomolecules which are detected in nanopore or fluidic channel devices. Identification of flap locations enables a map of the target biomolecule to be derived.


A protocol and system for determining sites at which proteins directly bind to DNA or RNA, modify other proteins including histones, or bind to other proteins as well as determining sites at which DNA or RNA is modified is described herein. A simplified, highly accurate method for studying protein interactions with DNA or RNA and sites of DNA or RNA modification using nanodetector systems is provided.


Patent
Nabsys Inc. | Date: 2014-03-07

Embodiments of the present invention relate to a method for producing patterns of sequence specific markers on a chromosomal segment. By comparing these patterns to those produced on a reference chromosome, various genetic abnormalities can be detected.


Patent
Nabsys Inc. | Date: 2012-02-10

Assay methods for preparing a biomolecule analyte includes hybridizing a sequence specific oligonucleotide probe to a biomolecule template and reacting the resulting analyte with a binding moiety.


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.

Discover hidden collaborations