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 tree). Showing records 1 – 27 of 27 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Indian Institute of Science

1. Bhavsar, Rajul D. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.

Degree: 2011, Indian Institute of Science

 Over the last decade, biological sequence repositories have been growing at an exponential rate. Sophisticated indexing techniques are required to facilitate efficient searching through these… (more)

Subjects/Keywords: Suffix-Tree; Suffix-tree Indexing; Disk-based Suffix-trees; Suffix-tree Internal Nodes; Suffix Trees - Storage Optimization; Suffix-tree Layouts; Suffix-Tree Nodes; Disk-resident Suffix-trees; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhavsar, R. D. (2011). Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/2124

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):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Thesis, Indian Institute of Science. Accessed October 18, 2019. http://hdl.handle.net/2005/2124.

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

MLA Handbook (7th Edition):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Web. 18 Oct 2019.

Vancouver:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2005/2124.

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

Council of Science Editors:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Thesis]. Indian Institute of Science; 2011. Available from: http://hdl.handle.net/2005/2124

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


Indian Institute of Science

2. Bhavsar, Rajul D. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.

Degree: 2011, Indian Institute of Science

 Over the last decade, biological sequence repositories have been growing at an exponential rate. Sophisticated indexing techniques are required to facilitate efficient searching through these… (more)

Subjects/Keywords: Suffix-Tree; Suffix-tree Indexing; Disk-based Suffix-trees; Suffix-tree Internal Nodes; Suffix Trees - Storage Optimization; Suffix-tree Layouts; Suffix-Tree Nodes; Disk-resident Suffix-trees; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhavsar, R. D. (2011). Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. (Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf

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):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Thesis, Indian Institute of Science. Accessed October 18, 2019. http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf.

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

MLA Handbook (7th Edition):

Bhavsar, Rajul D. “Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes.” 2011. Web. 18 Oct 2019.

Vancouver:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Internet] [Thesis]. Indian Institute of Science; 2011. [cited 2019 Oct 18]. Available from: http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf.

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

Council of Science Editors:

Bhavsar RD. Search-Optimized Disk Layouts For Suffix-Tree Genomic Indexes. [Thesis]. Indian Institute of Science; 2011. Available from: http://etd.iisc.ernet.in/handle/2005/2124 ; http://etd.ncsi.iisc.ernet.in/abstracts/2728/G24897-Abs.pdf

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


Louisiana State University

3. Satish, Umesh Chandra. Parallel Suffix Tree Construction for Genome Sequence Using Hadoop.

Degree: MSCS, Computer Sciences, 2013, Louisiana State University

 Indexing the genome is the basis for many of the bioinformatics applications. Read mapping (sequence alignment) is one such application to align millions of short… (more)

Subjects/Keywords: Ukkonnen Suffix Tree; Map-Reduce based Suffix tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Satish, U. C. (2013). Parallel Suffix Tree Construction for Genome Sequence Using Hadoop. (Masters Thesis). Louisiana State University. Retrieved from etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665

Chicago Manual of Style (16th Edition):

Satish, Umesh Chandra. “Parallel Suffix Tree Construction for Genome Sequence Using Hadoop.” 2013. Masters Thesis, Louisiana State University. Accessed October 18, 2019. etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665.

MLA Handbook (7th Edition):

Satish, Umesh Chandra. “Parallel Suffix Tree Construction for Genome Sequence Using Hadoop.” 2013. Web. 18 Oct 2019.

Vancouver:

Satish UC. Parallel Suffix Tree Construction for Genome Sequence Using Hadoop. [Internet] [Masters thesis]. Louisiana State University; 2013. [cited 2019 Oct 18]. Available from: etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665.

Council of Science Editors:

Satish UC. Parallel Suffix Tree Construction for Genome Sequence Using Hadoop. [Masters Thesis]. Louisiana State University; 2013. Available from: etd-08122013-104039 ; https://digitalcommons.lsu.edu/gradschool_theses/1665


Louisiana State University

4. 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


Georgia Tech

5. 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


Washington State University

6. [No author]. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .

Degree: 2015, Washington State University

 The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid… (more)

Subjects/Keywords: Computer science; Bioinformatics; metagenomics; sequence alignment; SIMD; suffix tree; work stealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2015). SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . (Thesis). Washington State University. Retrieved from http://hdl.handle.net/2376/5503

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):

author], [No. “SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .” 2015. Thesis, Washington State University. Accessed October 18, 2019. http://hdl.handle.net/2376/5503.

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

MLA Handbook (7th Edition):

author], [No. “SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE .” 2015. Web. 18 Oct 2019.

Vancouver:

author] [. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . [Internet] [Thesis]. Washington State University; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/2376/5503.

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

Council of Science Editors:

author] [. SCALABLE PARALLEL METHODS FOR ANALYZING METAGENOMICS DATA AT EXTREME SCALE . [Thesis]. Washington State University; 2015. Available from: http://hdl.handle.net/2376/5503

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


NSYSU

7. 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


Brno University of Technology

8. 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

9. Carelo, Caio Cesar Mori. Perseus:uma nova técnica para tratar árvores de sufixo persistentes.

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

O avanço tecnológico dos laboratórios de biologia molecular tem proporcionado um grande aumento no volume de seqüências de nucleotídeos armazenadas em bancos de dados biológicos,… (more)

Subjects/Keywords: Árvore de sufixo; Bioinformática; Bioinformatics; Nucleotides sequence; Seqüencia de nucleotídeos; Suffix tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carelo, C. C. M. (2009). Perseus:uma nova técnica para tratar árvores de sufixo persistentes. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;

Chicago Manual of Style (16th Edition):

Carelo, Caio Cesar Mori. “Perseus:uma nova técnica para tratar árvores de sufixo persistentes.” 2009. Masters Thesis, University of São Paulo. Accessed October 18, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;.

MLA Handbook (7th Edition):

Carelo, Caio Cesar Mori. “Perseus:uma nova técnica para tratar árvores de sufixo persistentes.” 2009. Web. 18 Oct 2019.

Vancouver:

Carelo CCM. Perseus:uma nova técnica para tratar árvores de sufixo persistentes. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2019 Oct 18]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;.

Council of Science Editors:

Carelo CCM. Perseus:uma nova técnica para tratar árvores de sufixo persistentes. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19012010-103825/ ;


NSYSU

10. Lin, Bi-Shiang. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.

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

 Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS)… (more)

Subjects/Keywords: S-table; linear space; consecutive suffix alignment problem; longest common subsequence; range query; segment tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, B. (2017). The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

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):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Thesis, NSYSU. Accessed October 18, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

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

MLA Handbook (7th Edition):

Lin, Bi-Shiang. “The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem.” 2017. Web. 18 Oct 2019.

Vancouver:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2017. [cited 2019 Oct 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330.

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

Council of Science Editors:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0811117-153330

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


NSYSU

11. Liao, Zhi-Feng. An Efficient Algorithm for Mining Repeating Patterns.

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

 A repeating pattern is composed of identifiable elements that repeat in a predictable manner. In our real life, there are lots of applications such as… (more)

Subjects/Keywords: suffix tree; repeating pattern; fast mining of repeating patterns; data mining; repeating-pattern-index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, Z. (2016). An Efficient Algorithm for Mining Repeating Patterns. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911

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):

Liao, Zhi-Feng. “An Efficient Algorithm for Mining Repeating Patterns.” 2016. Thesis, NSYSU. Accessed October 18, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911.

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

MLA Handbook (7th Edition):

Liao, Zhi-Feng. “An Efficient Algorithm for Mining Repeating Patterns.” 2016. Web. 18 Oct 2019.

Vancouver:

Liao Z. An Efficient Algorithm for Mining Repeating Patterns. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Oct 18]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911.

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

Council of Science Editors:

Liao Z. An Efficient Algorithm for Mining Repeating Patterns. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0703116-150911

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


Louisiana State University

12. Kondikoppa, Praveenkumar. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis.

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

 Analysis of Big data to gain better insights has been the focus of researchers in the recent past. Traditional desktop computers or database management systems… (more)

Subjects/Keywords: MapReduce; Hadoop; Scheduler; Suffix Tree; Distributed Computing; Indexing; Genome; Parallel; Assembler; Apache Giraph; Pregel; PGA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kondikoppa, P. (2014). Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687

Chicago Manual of Style (16th Edition):

Kondikoppa, Praveenkumar. “Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis.” 2014. Doctoral Dissertation, Louisiana State University. Accessed October 18, 2019. etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687.

MLA Handbook (7th Edition):

Kondikoppa, Praveenkumar. “Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis.” 2014. Web. 18 Oct 2019.

Vancouver:

Kondikoppa P. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis. [Internet] [Doctoral dissertation]. Louisiana State University; 2014. [cited 2019 Oct 18]. Available from: etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687.

Council of Science Editors:

Kondikoppa P. Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis. [Doctoral Dissertation]. Louisiana State University; 2014. Available from: etd-07092014-152032 ; https://digitalcommons.lsu.edu/gradschool_dissertations/3687


Brno University of Technology

13. Hlaváček, Pavel. Konstrukce sufixových stromů a jejich využití v bioinformatice .

Degree: 2011, Brno University of Technology

 Práce se zabývá problematikou implementace sufixových stromů a jejich využití v bioinformatice. Jsou zde uvedeny různé druhy algoritmů pro tvorbu sufixových stromů. Především se zabývá implementací… (more)

Subjects/Keywords: Sufixový strom; Ukkonen; McCreight; online metoda; řetězec; podřetězce; prefix; sufix; přibližný; odpovídající; Suffix tree; Ukkonen; McCreight; online; string; substring; preffix; suffix; approximate; matching  

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hlaváček, P. (2011). Konstrukce sufixových stromů a jejich využití v bioinformatice . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55648

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):

Hlaváček, Pavel. “Konstrukce sufixových stromů a jejich využití v bioinformatice .” 2011. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/55648.

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

MLA Handbook (7th Edition):

Hlaváček, Pavel. “Konstrukce sufixových stromů a jejich využití v bioinformatice .” 2011. Web. 18 Oct 2019.

Vancouver:

Hlaváček P. Konstrukce sufixových stromů a jejich využití v bioinformatice . [Internet] [Thesis]. Brno University of Technology; 2011. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/55648.

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

Council of Science Editors:

Hlaváček P. Konstrukce sufixových stromů a jejich využití v bioinformatice . [Thesis]. Brno University of Technology; 2011. Available from: http://hdl.handle.net/11012/55648

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


University of Manitoba

14. Devanarayana, Chamara. Spectrum access in cognitive radio networks based on prediction and estimation.

Degree: Electrical and Computer Engineering, 2015, University of Manitoba

 In the literature, Cognitive radio (CR) as well as full-duplex (FD) communication technologies are proposed to increase the spectrum efficiency. The main contribution of this… (more)

Subjects/Keywords: Cognitive Radio; Overlay networks; Underlay networks; Prediction and estimation; Probabilistic suffix tree algorithm; Monotonic optimization; Resource allocation; D2D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Devanarayana, C. (2015). Spectrum access in cognitive radio networks based on prediction and estimation. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/31605

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):

Devanarayana, Chamara. “Spectrum access in cognitive radio networks based on prediction and estimation.” 2015. Thesis, University of Manitoba. Accessed October 18, 2019. http://hdl.handle.net/1993/31605.

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

MLA Handbook (7th Edition):

Devanarayana, Chamara. “Spectrum access in cognitive radio networks based on prediction and estimation.” 2015. Web. 18 Oct 2019.

Vancouver:

Devanarayana C. Spectrum access in cognitive radio networks based on prediction and estimation. [Internet] [Thesis]. University of Manitoba; 2015. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1993/31605.

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

Council of Science Editors:

Devanarayana C. Spectrum access in cognitive radio networks based on prediction and estimation. [Thesis]. University of Manitoba; 2015. Available from: http://hdl.handle.net/1993/31605

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


Universidad de Chile

15. Abeliuk Kimelman, Andrés Jonathan. Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos .

Degree: 2012, Universidad de Chile

 El árbol de sufijos es una de las estructuras más importantes que se han creado para el manejo de cadenas de caracteres. Esta estructura permite… (more)

Subjects/Keywords: Computación; Compresión de datos (Ciencia de la Computación); Estructuras de datos (Ciencias de la Computación); Suffix tree; Estructuras compactas

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abeliuk Kimelman, A. J. (2012). Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos . (Thesis). Universidad de Chile. Retrieved from http://www.repositorio.uchile.cl/handle/2250/104369

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):

Abeliuk Kimelman, Andrés Jonathan. “Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos .” 2012. Thesis, Universidad de Chile. Accessed October 18, 2019. http://www.repositorio.uchile.cl/handle/2250/104369.

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

MLA Handbook (7th Edition):

Abeliuk Kimelman, Andrés Jonathan. “Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos .” 2012. Web. 18 Oct 2019.

Vancouver:

Abeliuk Kimelman AJ. Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos . [Internet] [Thesis]. Universidad de Chile; 2012. [cited 2019 Oct 18]. Available from: http://www.repositorio.uchile.cl/handle/2250/104369.

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

Council of Science Editors:

Abeliuk Kimelman AJ. Arboles de Sufijo Comprimidos para Textos Altamente Repetitivos . [Thesis]. Universidad de Chile; 2012. Available from: http://www.repositorio.uchile.cl/handle/2250/104369

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

16. 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

17. 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

18. 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


Universidade Nova

19. 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

20. Remiáš, Richard. Vyhledávání přibližných palindromů v DNA sekvencích .

Degree: 2010, Brno University of Technology

 Práca sa zaoberá problematikou vyhľadávania presných a približných palindrómov. V súvislosti s vyhľadávaním presných palindrómov analyzuje naivný postup vyhľadávania ako aj postupy založené na sufixových… (more)

Subjects/Keywords: Palindrom; přibližný palindrom;  přesný palindrom; vyhledávání palindromů; sufixový strom;  dynamické programování.; Palindrome; approximate palindrome; exact palindrome; palindrome searching; suffix tree; dynamic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Remiáš, R. (2010). Vyhledávání přibližných palindromů v DNA sekvencích . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52995

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):

Remiáš, Richard. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2010. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/52995.

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

MLA Handbook (7th Edition):

Remiáš, Richard. “Vyhledávání přibližných palindromů v DNA sekvencích .” 2010. Web. 18 Oct 2019.

Vancouver:

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

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

Council of Science Editors:

Remiáš R. Vyhledávání přibližných palindromů v DNA sekvencích . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/52995

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


Brno University of Technology

21. Angelov, Michael. Hudební improvizace .

Degree: 2009, Brno University of Technology

 Bakalářská práce sa zabývá problematikou algoritmické kompozice hudby, zejména oblastí počítačem řízené hudební improvizace. V úvodních kapitolách je uveden přehled existujícich nástrojů a přístupů nejčastěji… (more)

Subjects/Keywords: MIDI; improvizace; algoritmická kompozice hudby; počítačová hudba; prediction suffix tree; PST; markovské řetězce; MIDI; improvisation; algorithmic music composition; computer music; prediction suffix tree; PST; markov chains

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angelov, M. (2009). Hudební improvizace . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54559

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):

Angelov, Michael. “Hudební improvizace .” 2009. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/54559.

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

MLA Handbook (7th Edition):

Angelov, Michael. “Hudební improvizace .” 2009. Web. 18 Oct 2019.

Vancouver:

Angelov M. Hudební improvizace . [Internet] [Thesis]. Brno University of Technology; 2009. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/54559.

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

Council of Science Editors:

Angelov M. Hudební improvizace . [Thesis]. Brno University of Technology; 2009. Available from: http://hdl.handle.net/11012/54559

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


University of Waterloo

22. 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


Brno University of Technology

23. Šabatka, Ondřej. Reprezentace textu a její vliv na kategorizaci .

Degree: 2010, Brno University of Technology

 Diplomová práce se zabývá strojovým zpracováním textových dat. V teoretické části jsou popsány problémy související se zpracováním přirozeného jazyka a dále jsou představeny různé způsoby… (more)

Subjects/Keywords: kategorizace; klasifikační metody; dolování z textu; TF-IDF; reprezentace textu; reprezentace textových dokumentů; N-gramy; algoritmus Sufixového stromu; categorization; classification algorithms; text mining; TF-IDF; representation of text; representation of text documents; N-grams; Suffix tree algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Šabatka, O. (2010). Reprezentace textu a její vliv na kategorizaci . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54406

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):

Šabatka, Ondřej. “Reprezentace textu a její vliv na kategorizaci .” 2010. Thesis, Brno University of Technology. Accessed October 18, 2019. http://hdl.handle.net/11012/54406.

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

MLA Handbook (7th Edition):

Šabatka, Ondřej. “Reprezentace textu a její vliv na kategorizaci .” 2010. Web. 18 Oct 2019.

Vancouver:

Šabatka O. Reprezentace textu a její vliv na kategorizaci . [Internet] [Thesis]. Brno University of Technology; 2010. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/11012/54406.

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

Council of Science Editors:

Šabatka O. Reprezentace textu a její vliv na kategorizaci . [Thesis]. Brno University of Technology; 2010. Available from: http://hdl.handle.net/11012/54406

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


University of Guelph

24. Wickland, David D. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .

Degree: 2017, University of Guelph

 The music industry was the first mass-media industry to be transformed by the transition to digital. Today, music consumers have access to personal libraries, subscription-based… (more)

Subjects/Keywords: symbolic similarity; melodic similarity; local alignment; global alignment; music similarity; suffix tree; cover song; longest common substring; pattern matching; sequence alignment; pairwise; exact matching; inexact matching; approximate matching; string matching; music information retrieval; MIR

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wickland, D. D. (2017). Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . (Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608

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):

Wickland, David D. “Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .” 2017. Thesis, University of Guelph. Accessed October 18, 2019. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608.

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

MLA Handbook (7th Edition):

Wickland, David D. “Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees .” 2017. Web. 18 Oct 2019.

Vancouver:

Wickland DD. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . [Internet] [Thesis]. University of Guelph; 2017. [cited 2019 Oct 18]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608.

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

Council of Science Editors:

Wickland DD. Evaluating Melodic Similarity Using Pairwise Sequence Alignments and Suffix Trees . [Thesis]. University of Guelph; 2017. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/11608

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


Universidad de Chile

25. Cánovas Barroso, Rodrigo Antonio. Estructuras Comprimidas para Árboles de Sufijos .

Degree: 2010, Universidad de Chile

Subjects/Keywords: Computación; Estructuras de datos (Ciencias de la Computación); Compresión de datos (Ciencias de la Computación); Estructuras compactas; Suffix tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cánovas Barroso, R. A. (2010). Estructuras Comprimidas para Árboles de Sufijos . (Thesis). Universidad de Chile. Retrieved from http://www.tesis.uchile.cl/tesis/uchile/2010/cf-canovas_rb/html/index-frames.html

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):

Cánovas Barroso, Rodrigo Antonio. “Estructuras Comprimidas para Árboles de Sufijos .” 2010. Thesis, Universidad de Chile. Accessed October 18, 2019. http://www.tesis.uchile.cl/tesis/uchile/2010/cf-canovas_rb/html/index-frames.html.

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

MLA Handbook (7th Edition):

Cánovas Barroso, Rodrigo Antonio. “Estructuras Comprimidas para Árboles de Sufijos .” 2010. Web. 18 Oct 2019.

Vancouver:

Cánovas Barroso RA. Estructuras Comprimidas para Árboles de Sufijos . [Internet] [Thesis]. Universidad de Chile; 2010. [cited 2019 Oct 18]. Available from: http://www.tesis.uchile.cl/tesis/uchile/2010/cf-canovas_rb/html/index-frames.html.

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

Council of Science Editors:

Cánovas Barroso RA. Estructuras Comprimidas para Árboles de Sufijos . [Thesis]. Universidad de Chile; 2010. Available from: http://www.tesis.uchile.cl/tesis/uchile/2010/cf-canovas_rb/html/index-frames.html

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


Georgia Tech

26. Mallikarjuna, Trishul. Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework.

Degree: MS, Center for Music Technology, 2010, Georgia Tech

 Elements of continuous variation such as tremolo, vibrato and portamento enable dimensions of their own in expressive melodic music in styles such as in Indian… (more)

Subjects/Keywords: Portavibratremo; Octave; Tri-octave; Position-in-bar; PIB; Position in bar; Octave errors; Metadata; Suffix tree; Parag chordia; Pitch tracking; Parametric modeling; MSP; Pitch classportamento lag; Vibrato rate; N-gram; Gtcmt; Trishul mallikarjuna; Pitch track; Markov tree; Max; Markov; Trie; Probabilistic modeling; Tremolo; Vibrato depth; Vibrato; Muti-attribute; Portamento; Tremolo rate; Tremolo depth; Music; Markov processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mallikarjuna, T. (2010). Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/37190

Chicago Manual of Style (16th Edition):

Mallikarjuna, Trishul. “Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework.” 2010. Masters Thesis, Georgia Tech. Accessed October 18, 2019. http://hdl.handle.net/1853/37190.

MLA Handbook (7th Edition):

Mallikarjuna, Trishul. “Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework.” 2010. Web. 18 Oct 2019.

Vancouver:

Mallikarjuna T. Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework. [Internet] [Masters thesis]. Georgia Tech; 2010. [cited 2019 Oct 18]. Available from: http://hdl.handle.net/1853/37190.

Council of Science Editors:

Mallikarjuna T. Towards expressive melodic accompaniment using parametric modeling of continuous musical elements in a multi-attribute prediction suffix trie framework. [Masters Thesis]. Georgia Tech; 2010. Available from: http://hdl.handle.net/1853/37190

27. Mondal, Kartick Chandra. Algorithmes pour la fouille de données et la bio-informatique : Algorithms for data mining and bio-informatics.

Degree: Docteur es, Informatique, 2013, Nice

L'extraction de règles d'association et de bi-clusters sont deux techniques de fouille de données complémentaires majeures, notamment pour l'intégration de connaissances. Ces techniques sont utilisées… (more)

Subjects/Keywords: Extraction de connaissances à partir des données; Bases de règles d'association; Règles de classification; Règles d'association conceptuelles; Itemsets fermés fréquents; Treillis des itemsets fermés; Connexion de galois; Analyse de concepts formels; Structures de données; Arbres suffixés; Data mining; Knowledge discovery in database; Bases of association rules; Classification rules; Conceptual association rules; Bi-clustering; Frequent closed itemsets; Closed itemset lattice; Galois connection; Formal concept analysis; Suffix-tree data structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mondal, K. C. (2013). Algorithmes pour la fouille de données et la bio-informatique : Algorithms for data mining and bio-informatics. (Doctoral Dissertation). Nice. Retrieved from http://www.theses.fr/2013NICE4049

Chicago Manual of Style (16th Edition):

Mondal, Kartick Chandra. “Algorithmes pour la fouille de données et la bio-informatique : Algorithms for data mining and bio-informatics.” 2013. Doctoral Dissertation, Nice. Accessed October 18, 2019. http://www.theses.fr/2013NICE4049.

MLA Handbook (7th Edition):

Mondal, Kartick Chandra. “Algorithmes pour la fouille de données et la bio-informatique : Algorithms for data mining and bio-informatics.” 2013. Web. 18 Oct 2019.

Vancouver:

Mondal KC. Algorithmes pour la fouille de données et la bio-informatique : Algorithms for data mining and bio-informatics. [Internet] [Doctoral dissertation]. Nice; 2013. [cited 2019 Oct 18]. Available from: http://www.theses.fr/2013NICE4049.

Council of Science Editors:

Mondal KC. Algorithmes pour la fouille de données et la bio-informatique : Algorithms for data mining and bio-informatics. [Doctoral Dissertation]. Nice; 2013. Available from: http://www.theses.fr/2013NICE4049

.