Sequence Factorization with Multiple References
نویسندگان
چکیده
منابع مشابه
Sequence Factorization with Multiple References
The success of high-throughput sequencing has lead to an increasing number of projects which sequence large populations of a species. Storage and analysis of sequence data is a key challenge in these projects, because of the sheer size of the datasets. Compression is one simple technology to deal with this challenge. Referential factorization and compression schemes, which store only the differ...
متن کاملEvolutionary profiles from the QR factorization of multiple sequence alignments.
We present an algorithm to generate complete evolutionary profiles that represent the topology of the molecular phylogenetic tree of the homologous group. The method, based on the multidimensional QR factorization of numerically encoded multiple sequence alignments, removes redundancy from the alignments and orders the protein sequences by increasing linear dependence, resulting in the identifi...
متن کاملMultiple Sclerosis - References
Canada MS Pathways " MS Pathways is a network of highly specialized and compassionate nurses who can help you through some of the challenges that are associated with living with multiple sclerosis. MS Pathways is a free, full-service, confidential support service for Canadians with multiple sclerosis (MS). " Newcastle " The team was set up in 1995 as a joint venture between health, social servi...
متن کاملGeneralized Series Imaging with Multiple References
Many imaging applications require the acquisition of a time series of images. In conventional Fourier transformbased imaging methods, each of these images is acquired independently. As a result, one often has to sacrifice spatial resolution for temporal resolution. To address this problem, this paper extends a generalized series imaging method so that multiple references can be used to achieve ...
متن کاملMRCSI: Compressing and Searching String Collections with Multiple References
Efficiently storing and searching collections of similar strings, such as large populations of genomes or long change histories of documents from Wikis, is a timely and challenging problem. Several recent proposals could drastically reduce space requirements by exploiting the similarity between strings in so-called referencebased compression. However, these indexes are usually not searchable an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0139000