Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Suffix Array). Showing records 1 – 19 of 19 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Georgia Tech

1. Flick, Patrick. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.

Degree: PhD, Computational Science and Engineering, 2019, Georgia Tech

 Methods for processing and analyzing DNA and genomic data are built upon combinatorial graph and string algorithms. The advent of high-throughput DNA sequencing is enabling… (more)

Subjects/Keywords: distributed memory; suffix array; suffix tree; enhanced suffix arrays; de bruijn graphs; distributed graphs; connected components

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Flick, P. (2019). Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/61257

Chicago Manual of Style (16th Edition):

Flick, Patrick. “Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.” 2019. Doctoral Dissertation, Georgia Tech. Accessed October 18, 2019. http://hdl.handle.net/1853/61257.

MLA Handbook (7th Edition):

Flick, Patrick. “Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems.” 2019. Web. 18 Oct 2019.

Vancouver:

Flick P. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2019. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1853/61257.

Council of Science Editors:

Flick P. Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems. [Doctoral Dissertation]. Georgia Tech; 2019. Available from: http://hdl.handle.net/1853/61257


NSYSU

2. Hu, Jen-Wei. An ACGT-Words Tree for Efficient Data Access in Genomic Databases.

Degree: Master, Computer Science and Engineering, 2003, NSYSU

 Genomic sequence databases, like GenBank, EMBL, are widely used by molecular biologists for homology searching. Because of the increase of the size of genomic sequence… (more)

Subjects/Keywords: DNA sequence; genomic databases; indexing; suffix tree; suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hu, J. (2003). An ACGT-Words Tree for Efficient Data Access in Genomic Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hu, Jen-Wei. “An ACGT-Words Tree for Efficient Data Access in Genomic Databases.” 2003. Thesis, NSYSU. Accessed October 18, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hu, Jen-Wei. “An ACGT-Words Tree for Efficient Data Access in Genomic Databases.” 2003. Web. 18 Oct 2019.

Vancouver:

Hu J. An ACGT-Words Tree for Efficient Data Access in Genomic Databases. [Internet] [Thesis]. NSYSU; 2003. [cited 2019 Oct 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hu J. An ACGT-Words Tree for Efficient Data Access in Genomic Databases. [Thesis]. NSYSU; 2003. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725103-114311

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

3. Poddar, Anindya. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction.

Degree: PhD, Computer Sciences, 2011, Louisiana State University

 Preprocessing of database is inevitable to extract information from large databases like biological sequences of gene or protein. Discovery of patterns becomes very time efficient… (more)

Subjects/Keywords: String; Proteome; N-gram tree; N-gram tree of text; Substring; Pattern; Genome; N-gram; Suffix Tree; Suffix Array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Poddar, A. (2011). Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490

Chicago Manual of Style (16th Edition):

Poddar, Anindya. “Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction.” 2011. Doctoral Dissertation, Louisiana State University. Accessed October 18, 2019. etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490.

MLA Handbook (7th Edition):

Poddar, Anindya. “Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction.” 2011. Web. 18 Oct 2019.

Vancouver:

Poddar A. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. [Internet] [Doctoral dissertation]. Louisiana State University; 2011. [cited 2019 Oct 18]. Available from: etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490.

Council of Science Editors:

Poddar A. Efficient Substring Discovery Using Suffix, LCP Array and Algorithm-Architecture Interaction. [Doctoral Dissertation]. Louisiana State University; 2011. Available from: etd-04152011-174740 ; https://digitalcommons.lsu.edu/gradschool_dissertations/490


Brno University of Technology

4. Klouba, Lukáš. Celogenomové zarovnání pomocí suffixových stromů .

Degree: 2017, Brno University of Technology

 Cílem této práce je vytvořit algoritmus, který pomocí sufixových konstrukcí umožní zarovnání genomu dvou organismů, a implementovat jej do programového prostředí jazyka R. Práce se… (more)

Subjects/Keywords: sufixové stromy; sufixová pole; Ukkonenův algoritmus; R; celogenomové zarovnání; suffix tree; suffix array; Ukkonen’s algorithm; R; whole-genome alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Klouba, L. (2017). Celogenomové zarovnání pomocí suffixových stromů . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/65466

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Klouba, Lukáš. “Celogenomové zarovnání pomocí suffixových stromů .” 2017. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/65466.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Klouba, Lukáš. “Celogenomové zarovnání pomocí suffixových stromů .” 2017. Web. 18 Oct 2019.

Vancouver:

Klouba L. Celogenomové zarovnání pomocí suffixových stromů . [Internet] [Thesis]. Brno University of Technology; 2017. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/65466.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Klouba L. Celogenomové zarovnání pomocí suffixových stromů . [Thesis]. Brno University of Technology; 2017. Available from: http://hdl.handle.net/11012/65466

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

5. Hlávka, Ondřej. Konstrukce sufixových polí a jejich využití v bioinformatice .

Degree: 2011, Brno University of Technology

 Práce pojednává o perspektivní datové struktuře, která se nazývá sufixové pole. Tato datová struktura je zde podrobněji popsána a v práci je dále uvedeno rozdělení… (more)

Subjects/Keywords: Sufixové pole; sufix; přesné vyhledávání; přibližné vyhledávání; QUASAR; qsufsort; Suffix array; suffix; exact matching; approximate matching; QUASAR; qsufsort

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hlávka, O. (2011). Konstrukce sufixových polí a jejich využití v bioinformatice . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55673

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hlávka, Ondřej. “Konstrukce sufixových polí a jejich využití v bioinformatice .” 2011. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/55673.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hlávka, Ondřej. “Konstrukce sufixových polí a jejich využití v bioinformatice .” 2011. Web. 18 Oct 2019.

Vancouver:

Hlávka O. Konstrukce sufixových polí a jejich využití v bioinformatice . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/55673.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hlávka O. Konstrukce sufixových polí a jejich využití v bioinformatice . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55673

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


RMIT University

6. Dhaliwal, J. Space efficient algorithms for string processing.

Degree: 2013, RMIT University

 The suffix array (SA), which is an array containing the suffixes of a string sorted into lexicographical order, was introduced in the late eighties as… (more)

Subjects/Keywords: Fields of Research; suffix array; Burrows-Wheeler transform; longest-common-prefix array; inverse Burrows-Wheeler transform; data structures; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dhaliwal, J. (2013). Space efficient algorithms for string processing. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:160462

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dhaliwal, J. “Space efficient algorithms for string processing.” 2013. Thesis, RMIT University. Accessed October 18, 2019. http://researchbank.rmit.edu.au/view/rmit:160462.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dhaliwal, J. “Space efficient algorithms for string processing.” 2013. Web. 18 Oct 2019.

Vancouver:

Dhaliwal J. Space efficient algorithms for string processing. [Internet] [Thesis]. RMIT University; 2013. [cited 2019 Oct 18]. Available from: http://researchbank.rmit.edu.au/view/rmit:160462.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dhaliwal J. Space efficient algorithms for string processing. [Thesis]. RMIT University; 2013. Available from: http://researchbank.rmit.edu.au/view/rmit:160462

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

7. 今村, 友明. 日本語文の係受け構造を利用した情報検索 : ニホンゴブン ノ カカリウケ コウゾウ オ リヨウシタ ジョウホウ ケンサク.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

Subjects/Keywords: 係受け構造; suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

今村, . (n.d.). 日本語文の係受け構造を利用した情報検索 : ニホンゴブン ノ カカリウケ コウゾウ オ リヨウシタ ジョウホウ ケンサク. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/2105

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

今村, 友明. “日本語文の係受け構造を利用した情報検索 : ニホンゴブン ノ カカリウケ コウゾウ オ リヨウシタ ジョウホウ ケンサク.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed October 18, 2019. http://hdl.handle.net/10061/2105.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

今村, 友明. “日本語文の係受け構造を利用した情報検索 : ニホンゴブン ノ カカリウケ コウゾウ オ リヨウシタ ジョウホウ ケンサク.” Web. 18 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

今村 . 日本語文の係受け構造を利用した情報検索 : ニホンゴブン ノ カカリウケ コウゾウ オ リヨウシタ ジョウホウ ケンサク. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10061/2105.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

今村 . 日本語文の係受け構造を利用した情報検索 : ニホンゴブン ノ カカリウケ コウゾウ オ リヨウシタ ジョウホウ ケンサク. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/2105

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Southern California

8. Wu, Ping-Hao. Efficient management techniques for large video collections.

Degree: PhD, Electrical Engineering, 2010, University of Southern California

 In this research, we focus on two techniques related to the management of large video collection: video copy detection and automatic video classification. After the… (more)

Subjects/Keywords: duplicate video detection; video copy detection; suffix array; video classification; video database; camera operation; camera transition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, P. (2010). Efficient management techniques for large video collections. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/341017/rec/2244

Chicago Manual of Style (16th Edition):

Wu, Ping-Hao. “Efficient management techniques for large video collections.” 2010. Doctoral Dissertation, University of Southern California. Accessed October 18, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/341017/rec/2244.

MLA Handbook (7th Edition):

Wu, Ping-Hao. “Efficient management techniques for large video collections.” 2010. Web. 18 Oct 2019.

Vancouver:

Wu P. Efficient management techniques for large video collections. [Internet] [Doctoral dissertation]. University of Southern California; 2010. [cited 2019 Oct 18]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/341017/rec/2244.

Council of Science Editors:

Wu P. Efficient management techniques for large video collections. [Doctoral Dissertation]. University of Southern California; 2010. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll127/id/341017/rec/2244


Universiteit Hasselt

9. NULENS, Raf. Sequentie analyse.

Degree: 2005, Universiteit Hasselt

Subjects/Keywords: Suffix trees; incrementele opbouw; TOP-Q en TDD; suffix array; Vmatch; Blast; Quasar; PSI-blast; suffix sequoia; oasis; mummer; possumsearch

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

NULENS, R. (2005). Sequentie analyse. (Thesis). Universiteit Hasselt. Retrieved from http://hdl.handle.net/1942/1095

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

NULENS, Raf. “Sequentie analyse.” 2005. Thesis, Universiteit Hasselt. Accessed October 18, 2019. http://hdl.handle.net/1942/1095.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

NULENS, Raf. “Sequentie analyse.” 2005. Web. 18 Oct 2019.

Vancouver:

NULENS R. Sequentie analyse. [Internet] [Thesis]. Universiteit Hasselt; 2005. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1942/1095.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

NULENS R. Sequentie analyse. [Thesis]. Universiteit Hasselt; 2005. Available from: http://hdl.handle.net/1942/1095

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. WONG SWEE SEONG. String matching and indexing with suffix data structures.

Degree: 2008, National University of Singapore

Subjects/Keywords: suffix tree; suffix array; compressed suffix data structures; string indexing; string matching; sequence alignment search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

SEONG, W. S. (2008). String matching and indexing with suffix data structures. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

SEONG, WONG SWEE. “String matching and indexing with suffix data structures.” 2008. Thesis, National University of Singapore. Accessed October 18, 2019. http://scholarbank.nus.edu.sg/handle/10635/13083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

SEONG, WONG SWEE. “String matching and indexing with suffix data structures.” 2008. Web. 18 Oct 2019.

Vancouver:

SEONG WS. String matching and indexing with suffix data structures. [Internet] [Thesis]. National University of Singapore; 2008. [cited 2019 Oct 18]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

SEONG WS. String matching and indexing with suffix data structures. [Thesis]. National University of Singapore; 2008. Available from: http://scholarbank.nus.edu.sg/handle/10635/13083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

11. Soares Neto, Domingos. Filtros para a busca e extração de padrões aproximados em cadeias biológicas.

Degree: Mestrado, Ciência da Computação, 2008, University of São Paulo

Esta dissertação de mestrado aborda formulações computacionais e algoritmos para a busca e extração de padrões em cadeias biológicas. Em particular, o presente texto concentra-se… (more)

Subjects/Keywords: algoritmos bit-paralelos; algoritmos de filtragem; approximate string matching; árvores dos sufixos; bit-parallel algorithms; busca aproximada de padrões; extração de padrões; filter algorithms; motifs; motifs; patterns extraction; q-gramas; q-grams; suffix array; suffix tree; vetor dos sufixos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Soares Neto, D. (2008). Filtros para a busca e extração de padrões aproximados em cadeias biológicas. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;

Chicago Manual of Style (16th Edition):

Soares Neto, Domingos. “Filtros para a busca e extração de padrões aproximados em cadeias biológicas.” 2008. Masters Thesis, University of São Paulo. Accessed October 18, 2019. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;.

MLA Handbook (7th Edition):

Soares Neto, Domingos. “Filtros para a busca e extração de padrões aproximados em cadeias biológicas.” 2008. Web. 18 Oct 2019.

Vancouver:

Soares Neto D. Filtros para a busca e extração de padrões aproximados em cadeias biológicas. [Internet] [Masters thesis]. University of São Paulo; 2008. [cited 2019 Oct 18]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;.

Council of Science Editors:

Soares Neto D. Filtros para a busca e extração de padrões aproximados em cadeias biológicas. [Masters Thesis]. University of São Paulo; 2008. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19102009-002745/ ;


Brno University of Technology

12. Divila, Jaroslav. Vyhledávání přibližných palindromů v DNA sekvencích .

Degree: 2012, Brno University of Technology

 Tato práce se zabývá návrhem a implementací nástroje pro vyhledávání přibližných palindromů v sekvencích DNA. Zaměřuje se na popis DNA struktury, významu palindromů v DNA… (more)

Subjects/Keywords: DNA; přibližné palindromy; vyhledávání palindromů; vyhledávání palindromů se smyčkou; sufixové stromy; sufixová pole; dynamické programování; vlásenky; křížové struktury; DNA; approximate palindromes; palidrome detection; stem-loop detection; suffix tree; suffix array; dynamics programming; hairpin; cruciform

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Divila, J. (2012). Vyhledávání přibližných palindromů v DNA sekvencích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53667

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Divila, Jaroslav. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2012. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/53667.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Divila, Jaroslav. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2012. Web. 18 Oct 2019.

Vancouver:

Divila J. Vyhledávání přibližných palindromů v DNA sekvencích . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/53667.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Divila J. Vyhledávání přibližných palindromů v DNA sekvencích . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/53667

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Louza, Felipe Alves da. Um algoritmo para a construção de vetores de sufixo generalizados em memória externa.

Degree: Mestrado, Ciências de Computação e Matemática Computacional, 2013, University of São Paulo

O vetor de sufixo é uma estrutura de dados importante utilizada em muitos problemas que envolvem cadeias de caracteres. Na literatura, muitos trabalhos têm sido… (more)

Subjects/Keywords: Biological data; Dados biológicos; External memory; Generalized suffix array; Genome assembly; Indexação; Indexing; Memória externa; Montagem de genomas; Vetor de sufixo generalizado

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Louza, F. A. d. (2013). Um algoritmo para a construção de vetores de sufixo generalizados em memória externa. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26032014-100626/ ;

Chicago Manual of Style (16th Edition):

Louza, Felipe Alves da. “Um algoritmo para a construção de vetores de sufixo generalizados em memória externa.” 2013. Masters Thesis, University of São Paulo. Accessed October 18, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26032014-100626/ ;.

MLA Handbook (7th Edition):

Louza, Felipe Alves da. “Um algoritmo para a construção de vetores de sufixo generalizados em memória externa.” 2013. Web. 18 Oct 2019.

Vancouver:

Louza FAd. Um algoritmo para a construção de vetores de sufixo generalizados em memória externa. [Internet] [Masters thesis]. University of São Paulo; 2013. [cited 2019 Oct 18]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26032014-100626/ ;.

Council of Science Editors:

Louza FAd. Um algoritmo para a construção de vetores de sufixo generalizados em memória externa. [Masters Thesis]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-26032014-100626/ ;


Universidade Nova

14. Costa, Jorge André Nogueira da. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.

Degree: 2017, Universidade Nova

 The amount of digital natural language text collections available nowadays is huge and it has been growing at an exponential rate. All this information can… (more)

Subjects/Keywords: Bilingual texts; Byte-codesWavelet Tree; Suffix Array; Machine Translation; Bilingual Framework; bilingual search; Domínio/Área Científica::Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Costa, J. A. N. d. (2017). Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. (Thesis). Universidade Nova. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Costa, Jorge André Nogueira da. “Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.” 2017. Thesis, Universidade Nova. Accessed October 18, 2019. https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Costa, Jorge André Nogueira da. “Time and Space Efficient Data Structures for Supporting Machine Translation Tasks.” 2017. Web. 18 Oct 2019.

Vancouver:

Costa JANd. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. [Internet] [Thesis]. Universidade Nova; 2017. [cited 2019 Oct 18]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Costa JANd. Time and Space Efficient Data Structures for Supporting Machine Translation Tasks. [Thesis]. Universidade Nova; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/28929

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

15. Černohub, Jan. Predikce transpozonů v DNA .

Degree: 2014, Brno University of Technology

 Cílem práce je seznámení se s problematikou uchovávání informace v DNA, provést rešerši na téma transpozony, bioinformatické nástroje a algoritmy, které jsou používány k jejich… (more)

Subjects/Keywords: bioinformatika; DNA; transpozon; evoluce; retroviry; detekce; predikce; LTR; pole suffixů; bioinformatics; DNA; transposable elements; transposon; evolution; retro-viruses; detection; prediction; LTR; long terminal repeats; suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Černohub, J. (2014). Predikce transpozonů v DNA . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53273

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Černohub, Jan. “Predikce transpozonů v DNA .” 2014. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/53273.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Černohub, Jan. “Predikce transpozonů v DNA .” 2014. Web. 18 Oct 2019.

Vancouver:

Černohub J. Predikce transpozonů v DNA . [Internet] [Thesis]. Brno University of Technology; 2014. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/53273.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Černohub J. Predikce transpozonů v DNA . [Thesis]. Brno University of Technology; 2014. Available from: http://hdl.handle.net/11012/53273

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Xiao, Qingmei. A Study on Music Retrieval based on Audio Fingerprinting : オーディオ指紋に基づく音楽検索に関する研究.

Degree: 博士(工学), 2013, Tokushima University / 徳島大学

Subjects/Keywords: オーディオ指紋; 音楽検索; ハミングスペース; 接尾辞配列; 圧縮接尾辞配列; Audio fingerprint; Music retrieval; Hamming space; Suffix array; Compressed suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xiao, Q. (2013). A Study on Music Retrieval based on Audio Fingerprinting : オーディオ指紋に基づく音楽検索に関する研究. (Thesis). Tokushima University / 徳島大学. Retrieved from http://repo.lib.tokushima-u.ac.jp/105923

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Xiao, Qingmei. “A Study on Music Retrieval based on Audio Fingerprinting : オーディオ指紋に基づく音楽検索に関する研究.” 2013. Thesis, Tokushima University / 徳島大学. Accessed October 18, 2019. http://repo.lib.tokushima-u.ac.jp/105923.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Xiao, Qingmei. “A Study on Music Retrieval based on Audio Fingerprinting : オーディオ指紋に基づく音楽検索に関する研究.” 2013. Web. 18 Oct 2019.

Vancouver:

Xiao Q. A Study on Music Retrieval based on Audio Fingerprinting : オーディオ指紋に基づく音楽検索に関する研究. [Internet] [Thesis]. Tokushima University / 徳島大学; 2013. [cited 2019 Oct 18]. Available from: http://repo.lib.tokushima-u.ac.jp/105923.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xiao Q. A Study on Music Retrieval based on Audio Fingerprinting : オーディオ指紋に基づく音楽検索に関する研究. [Thesis]. Tokushima University / 徳島大学; 2013. Available from: http://repo.lib.tokushima-u.ac.jp/105923

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. Vyverman, Michaël. ALFALFA : fast and accurate mapping of long next generation sequencing reads.

Degree: 2014, Ghent University

Subjects/Keywords: Science General; spliced alignment; long reads; read mapping; alignment; index structure; maximal exact matches; enhanced sparse suffix array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vyverman, M. (2014). ALFALFA : fast and accurate mapping of long next generation sequencing reads. (Thesis). Ghent University. Retrieved from http://hdl.handle.net/1854/LU-5784731

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vyverman, Michaël. “ALFALFA : fast and accurate mapping of long next generation sequencing reads.” 2014. Thesis, Ghent University. Accessed October 18, 2019. http://hdl.handle.net/1854/LU-5784731.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vyverman, Michaël. “ALFALFA : fast and accurate mapping of long next generation sequencing reads.” 2014. Web. 18 Oct 2019.

Vancouver:

Vyverman M. ALFALFA : fast and accurate mapping of long next generation sequencing reads. [Internet] [Thesis]. Ghent University; 2014. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1854/LU-5784731.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vyverman M. ALFALFA : fast and accurate mapping of long next generation sequencing reads. [Thesis]. Ghent University; 2014. Available from: http://hdl.handle.net/1854/LU-5784731

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

18. He, Meng. Succinct Indexes.

Degree: 2008, University of Waterloo

 This thesis defines and designs succinct indexes for several abstract data types (ADTs). The concept is to design auxiliary data structures that ideally occupy asymptotically… (more)

Subjects/Keywords: succinct data structures; data structures; string; binary relation; text index; suffix array; tree; graph; succinct index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

He, M. (2008). Succinct Indexes. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3583

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

He, Meng. “Succinct Indexes.” 2008. Thesis, University of Waterloo. Accessed October 18, 2019. http://hdl.handle.net/10012/3583.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

He, Meng. “Succinct Indexes.” 2008. Web. 18 Oct 2019.

Vancouver:

He M. Succinct Indexes. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10012/3583.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

He M. Succinct Indexes. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3583

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

19. Salavert Torres, José. Inexact Mapping of Short Biological Sequences in High Performance Computational Environments .

Degree: 2014, Universitat Politècnica de València

 La bioinformática es la aplicación de las ciencias computacionales a la gestión y análisis de datos biológicos. A partir de 2005, con la aparición de… (more)

Subjects/Keywords: Inexact mapping; Backward search; BWT; Burrows-Wheeler Transform; Suffix Array; GPGPU; GPU

…methods 5.1 Suffix Array compression . . . . . . . . . . . . . . . . . . . . . . 5.1.1 Vector S… …the Suffix Array (SA) and the Burrows-Wheeler transform (BWT). Also, we… …as a representation of the Inverse Suffix Array (ISA). Given a position in the… …A A 2.1.2 Suffix Array sorting algorithms As it is obtained only once for each… …lower computational cost than sorting non-related strings. A taxonomy of suffix array sorting… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Salavert Torres, J. (2014). Inexact Mapping of Short Biological Sequences in High Performance Computational Environments . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/43721

Chicago Manual of Style (16th Edition):

Salavert Torres, José. “Inexact Mapping of Short Biological Sequences in High Performance Computational Environments .” 2014. Doctoral Dissertation, Universitat Politècnica de València. Accessed October 18, 2019. http://hdl.handle.net/10251/43721.

MLA Handbook (7th Edition):

Salavert Torres, José. “Inexact Mapping of Short Biological Sequences in High Performance Computational Environments .” 2014. Web. 18 Oct 2019.

Vancouver:

Salavert Torres J. Inexact Mapping of Short Biological Sequences in High Performance Computational Environments . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2014. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/10251/43721.

Council of Science Editors:

Salavert Torres J. Inexact Mapping of Short Biological Sequences in High Performance Computational Environments . [Doctoral Dissertation]. Universitat Politècnica de València; 2014. Available from: http://hdl.handle.net/10251/43721

.