Conference Paper: Indexing similar DNA sequences
| Title | Indexing similar DNA sequences |
|---|---|
| Authors | Huang, S1 Lam, TW1 Sung, WK2 Tam, SL1 Yiu, SM1 |
| Keywords | Basic operation Genetic variation Genomic sequence Memory requirements R-sequences |
| Issue Date | 2010 |
| Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
| Citation | The 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010), Shandong, China, 19-21 July 2010. In Lecture Notes in Computer Science, v. 6124, p. 180-190 [How to Cite?] DOI: http://dx.doi.org/10.1007/978-3-642-14355-7_19 |
| Abstract | To study the genetic variations of a species, one basic operation is to search for occurrences of patterns in a large number of very similar genomic sequences. To build an indexing data structure on the concatenation of all sequences may require a lot of memory. In this paper, we propose a new scheme to index highly similar sequences by taking advantage of the similarity among the sequences. To store r sequences with k common segments, our index requires only O(n + N logN) bits of memory, where n is the total length of the common segments and N is the total length of the distinct regions in all texts. The total length of all sequences is rn + N, and any scheme to store these sequences requires Ω(n + N) bits. Searching for a pattern P of length m takes O(m+mlogN +mlog(rk)psc(P)+occ log n), where psc(P) is the number of prefixes of P that appear as a suffix of some common segments and occ is the number of occurrences of P in all sequences. In practice, rk ≤ N, and psc(P) is usually a small constant. We have implemented our solution1 and evaluated our solution using real DNA sequences. The experiments show that the memory requirement of our solution is much less than that required by BWT built on the concatenation of all sequences. When compared to the other existing solution (RLCSA), we use less memory with faster searching time. © Springer-Verlag Berlin Heidelberg 2010. |
| Description | LNCS v. 6124 is Proceedings of the 6th International Conference, AAIM 2010 |
| ISSN | 0302-9743 2011 SCImago Journal Rankings: 0.034 |
| DOI | http://dx.doi.org/10.1007/978-3-642-14355-7_19 |
| References | References in Scopus |
| dc.contributor.author | Huang, S |
|---|---|
| dc.contributor.author | Lam, TW |
| dc.contributor.author | Sung, WK |
| dc.contributor.author | Tam, SL |
| dc.contributor.author | Yiu, SM |
| dc.date.accessioned | 2011-09-23T06:04:20Z |
| dc.date.available | 2011-09-23T06:04:20Z |
| dc.date.issued | 2010 |
| dc.description.abstract | To study the genetic variations of a species, one basic operation is to search for occurrences of patterns in a large number of very similar genomic sequences. To build an indexing data structure on the concatenation of all sequences may require a lot of memory. In this paper, we propose a new scheme to index highly similar sequences by taking advantage of the similarity among the sequences. To store r sequences with k common segments, our index requires only O(n + N logN) bits of memory, where n is the total length of the common segments and N is the total length of the distinct regions in all texts. The total length of all sequences is rn + N, and any scheme to store these sequences requires Ω(n + N) bits. Searching for a pattern P of length m takes O(m+mlogN +mlog(rk)psc(P)+occ log n), where psc(P) is the number of prefixes of P that appear as a suffix of some common segments and occ is the number of occurrences of P in all sequences. In practice, rk ≤ N, and psc(P) is usually a small constant. We have implemented our solution1 and evaluated our solution using real DNA sequences. The experiments show that the memory requirement of our solution is much less than that required by BWT built on the concatenation of all sequences. When compared to the other existing solution (RLCSA), we use less memory with faster searching time. © Springer-Verlag Berlin Heidelberg 2010. |
| dc.description.nature | Link_to_subscribed_fulltext |
| dc.description | LNCS v. 6124 is Proceedings of the 6th International Conference, AAIM 2010 |
| dc.description.other | The 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010), Shandong, China, 19-21 July 2010. In Lecture Notes in Computer Science, v. 6124, p. 180-190 |
| dc.identifier.citation | The 6th International Conference on Algorithmic Aspects in Information and Management (AAIM 2010), Shandong, China, 19-21 July 2010. In Lecture Notes in Computer Science, v. 6124, p. 180-190 [How to Cite?] DOI: http://dx.doi.org/10.1007/978-3-642-14355-7_19 |
| dc.identifier.doi | http://dx.doi.org/10.1007/978-3-642-14355-7_19 |
| dc.identifier.epage | 190 |
| dc.identifier.hkuros | 192198 |
| dc.identifier.issn | 0302-9743 2011 SCImago Journal Rankings: 0.034 |
| dc.identifier.scopus | eid_2-s2.0-79956310837 |
| dc.identifier.spage | 180 |
| dc.identifier.uri | http://hdl.handle.net/10722/139980 |
| dc.identifier.volume | 6124 |
| dc.language | eng |
| dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
| dc.publisher.place | Germany |
| dc.relation.ispartof | Lecture Notes in Computer Science |
| dc.relation.references | References in Scopus |
| dc.rights | The original publication is available at www.springerlink.com |
| dc.subject | Basic operation |
| dc.subject | Genetic variation |
| dc.subject | Genomic sequence |
| dc.subject | Memory requirements |
| dc.subject | R-sequences |
| dc.title | Indexing similar DNA sequences |
| dc.type | Conference_Paper |
Author Affiliations
- The University of Hong Kong
- National University of Singapore