scholarly journals In a split sequence

2018 ◽  
Vol 19 (5) ◽  
pp. 254-254
Author(s):  
Sian Lewis
Keyword(s):  
Split Sequence

scholarly journals On the number of terms in the middle of almost split sequences over cycle-finite artin algebras

2014 ◽  
Vol 12 (1) ◽  
Author(s):  
Piotr Malicki ◽  
José Peña ◽  
Andrzej Skowroński
Keyword(s):  
Module Category ◽  
Artin Algebra ◽  
Split Sequence ◽  
Almost Split Sequence ◽  
Artin Algebras ◽  
Almost Split Sequences

AbstractWe prove that the number of terms in the middle of an almost split sequence in the module category of a cycle-finite artin algebra is bounded by 5.

Split sequence coalesced hashing

1988 ◽  
Vol 13 (2) ◽  
pp. 211-218
Author(s):  
D. Murthy ◽  
Pradip K. Srimani
Keyword(s):  
Split Sequence

Split sequence hash search

1985 ◽  
Vol 20 (3) ◽  
pp. 131-136 ◽  
Author(s):  
E. Lodi ◽  
F. Luccio
Keyword(s):  
Split Sequence

scholarly journals Improved Search of Large Transcriptomic Sequencing Databases Using Split Sequence Bloom Trees

2016 ◽  
Author(s):  
Brad Solomon ◽  
Carl Kingsford
Keyword(s):  
Population Variation ◽  
Rna Seq ◽  
Specific Expression ◽  
Short Read ◽  
Short Read Sequencing ◽  
Split Sequence ◽  
Transcriptomic Sequencing ◽  
And Storage ◽  
Expressed Sequence ◽  
Over Time

AbstractEnormous databases of short-read RNA-seq sequencing experiments such as the NIH Sequencing Read Archive (SRA) are now available. These databases could answer many questions about the condition-specific expression or population variation, and this resource is only going to grow over time. However, these collections remain difficult to use due to the inability to search for a particular expressed sequence. While some progress has been made on this problem, it is still not feasible to search collections of hundreds of terabytes of short-read sequencing experiments. We introduce an indexing scheme called Split Sequence Bloom Tree (SSBT) to support sequence-based querying of terabyte-scale collections of thousands of short-read sequencing experiments. SSBT is an improvement over the SBT [1] data structure for the same task. We apply SSBT to the problem of finding conditions under which query transcripts are expressed. Our experiments are conducted on a set of 2,652 publicly available RNA-seq experiments contained in the NIH for the breast, blood, and brain tissues. We demonstrate that this SSBT index can be queried for a 1000 nt sequence in under 4 minutes using a single thread and can be stored in just 39 GB, a five-fold improvement in search and storage costs compared to SBT. We further report that SSBT can be further optimized by pre-loading the entire index to accomplish the same search in 30 seconds.

Almost Split Sequences whose Middle Term has at most Two Indecomposable Summands

1979 ◽  
Vol 31 (5) ◽  
pp. 942-960 ◽  
Author(s):  
M. Auslander ◽  
R. Bautista ◽  
M. I. Platzeck ◽  
I. Reiten ◽  
S. O. Smalø
Keyword(s):  
Exact Sequence ◽  
Representation Theory ◽  
Finitely Generated ◽  
Artin Algebra ◽  
Middle Term ◽  
Split Sequence ◽  
Almost Split Sequence ◽  
Artin Algebras ◽  
Almost Split Sequences

Let Λ be an artin algebra, and denote by mod Λ the category of finitely generated Λ-modules. All modules we consider are finitely generated.We recall from [6] that a nonsplit exact sequence in mod A is said to be almost split if A and C are indecomposable, and given a map h: X → C which is not an isomorphism and with X indecomposable, there is some t: X → B such that gt = h.Almost split sequences have turned out to be useful in the study of representation theory of artin algebras. Given a nonprojective indecomposable Λ-module C (or an indecomposable noninjective Λ-module A), we know thatthere exists a unique almost split sequence [6, Proposition 4.3], [5, Section 3].

Sign in / Sign up

Export Citation Format

Share Document