Konferans bildirisi Açık Erişim
Kulekci, M. Oguzhan; Hon, Wing-Kai; Shah, Rahul; Vitter, Jeffrey Scott; Xu, Bojian
<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
<identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/92947</identifier>
<creators>
<creator>
<creatorName>Kulekci, M. Oguzhan</creatorName>
<givenName>M. Oguzhan</givenName>
<familyName>Kulekci</familyName>
<affiliation>Natl Res Inst Elect & Cryptol, Gebze, Turkey</affiliation>
</creator>
<creator>
<creatorName>Hon, Wing-Kai</creatorName>
<givenName>Wing-Kai</givenName>
<familyName>Hon</familyName>
<affiliation>Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu, Taiwan</affiliation>
</creator>
<creator>
<creatorName>Shah, Rahul</creatorName>
<givenName>Rahul</givenName>
<familyName>Shah</familyName>
<affiliation>Louisiana State Univ, Dept Comp Sci, Baton Rouge, LA 70803 USA</affiliation>
</creator>
<creator>
<creatorName>Vitter, Jeffrey Scott</creatorName>
<givenName>Jeffrey Scott</givenName>
<familyName>Vitter</familyName>
<affiliation>Univ Kansas, Informat & Telecomunicat Technol Ctr, Lawrence, KS 66045 USA</affiliation>
</creator>
<creator>
<creatorName>Xu, Bojian</creatorName>
<givenName>Bojian</givenName>
<familyName>Xu</familyName>
<affiliation>Univ Kansas, Informat & Telecomunicat Technol Ctr, Lawrence, KS 66045 USA</affiliation>
</creator>
</creators>
<titles>
<title>Psi-Ra: A Parallel Sparse Index For Read Alignment On Genomes</title>
</titles>
<publisher>Aperta</publisher>
<publicationYear>2010</publicationYear>
<dates>
<date dateType="Issued">2010-01-01</date>
</dates>
<resourceType resourceTypeGeneral="Text">Conference paper</resourceType>
<alternateIdentifiers>
<alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/92947</alternateIdentifier>
</alternateIdentifiers>
<relatedIdentifiers>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsVersionOf">10.81043/aperta.92946</relatedIdentifier>
<relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.81043/aperta.92947</relatedIdentifier>
</relatedIdentifiers>
<rightsList>
<rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
<rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
</rightsList>
<descriptions>
<description descriptionType="Abstract">We concentrate on indexing DNA sequences via sparse suffix arrays (SSAs) and propose a new short read aligner named PSI-RA (parallel sparse index read aligner). The motivation in using SSAs is the ability to trade memory against time. It is possible to tune the space consumption of the index based on the available memory of the machine and the minimum length of the arriving pattern queries. Although SSAs have been studied before on exact matching of short reads, an elegant way of approximate matching capability was missing. We provide this by defining the right-most mismatch criteria that prioritizes the errors towards the end of the reads since it is known that the errors are more probable at that area. PSI-RA supports any number of mismatches in aligning reads. We give comparisons with some of the well known short read aligners, and show that indexing genome with SSA is a good alternative to Burrows-Wheeler transform or seed based solutions.</description>
</descriptions>
</resource>
| Görüntülenme | 42 |
| İndirme | 6 |
| Veri hacmi | 1.1 kB |
| Tekil görüntülenme | 39 |
| Tekil indirme | 6 |