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 +publisher:"NSYSU" +contributor:("Kuo-Si Huang"). Showing records 1 – 21 of 21 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Yuan, Hsin-Chuan. A Survey of Computational Methods for Protein Structure Prediction.

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

 The job of protein structure prediction is not easy. Various types of techniques and resources have been developed and deployed in the past decades to… (more)

Subjects/Keywords: structural genomics; protein structure prediction; computational structural biology; tertiary structure prediction; tertiary structure; bioinformatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yuan, H. (2015). A Survey of Computational Methods for Protein Structure Prediction. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535

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

Yuan, Hsin-Chuan. “A Survey of Computational Methods for Protein Structure Prediction.” 2015. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535.

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

MLA Handbook (7th Edition):

Yuan, Hsin-Chuan. “A Survey of Computational Methods for Protein Structure Prediction.” 2015. Web. 28 Sep 2020.

Vancouver:

Yuan H. A Survey of Computational Methods for Protein Structure Prediction. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535.

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

Council of Science Editors:

Yuan H. A Survey of Computational Methods for Protein Structure Prediction. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0713115-153535

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


NSYSU

2. Hung, Siang-Huai. A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.

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

 The longest common subsequence (LCS) problem and its variations have been studied deeply in past decades. In the constrained longest common subsequence (CLCS) problem, given… (more)

Subjects/Keywords: diagonal; domination; similarity; constrained longest common subsequence; longest common subsequence; design of algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, S. (2018). A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718

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

Hung, Siang-Huai. “A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.” 2018. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718.

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

MLA Handbook (7th Edition):

Hung, Siang-Huai. “A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.” 2018. Web. 28 Sep 2020.

Vancouver:

Hung S. A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718.

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

Council of Science Editors:

Hung S. A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0701118-144718

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


NSYSU

3. Guo, Yi-pu. Efficient Algorithms for the Flexible Longest Common Subsequence Problem.

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

 Given two sequences, the traditional longest common subsequence (LCS) problem is to obtain the common subsequence with the maximum number of matches, without considering the… (more)

Subjects/Keywords: Dominant Strategy; Flexible Longest Common Subsequence; Longest Common Subsequence; Dynamic Programming; Sequence Alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, Y. (2014). Efficient Algorithms for the Flexible Longest Common Subsequence Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412

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

Guo, Yi-pu. “Efficient Algorithms for the Flexible Longest Common Subsequence Problem.” 2014. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412.

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

MLA Handbook (7th Edition):

Guo, Yi-pu. “Efficient Algorithms for the Flexible Longest Common Subsequence Problem.” 2014. Web. 28 Sep 2020.

Vancouver:

Guo Y. Efficient Algorithms for the Flexible Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2014. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412.

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

Council of Science Editors:

Guo Y. Efficient Algorithms for the Flexible Longest Common Subsequence Problem. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0020114-165412

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


NSYSU

4. Hsu, Chun-Chieh. The Department Score Prediction and Analysis of the College Entrance Examination.

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

 Prediction systems for college entrance examination (CEE) are used to give some recommendations for students to choose their ideal department. In Taiwan, more than 40%… (more)

Subjects/Keywords: prediction; fuzzy time series; precision; recall; college entrance examination; prediction system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, C. (2014). The Department Score Prediction and Analysis of the College Entrance Examination. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232

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

Hsu, Chun-Chieh. “The Department Score Prediction and Analysis of the College Entrance Examination.” 2014. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232.

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

MLA Handbook (7th Edition):

Hsu, Chun-Chieh. “The Department Score Prediction and Analysis of the College Entrance Examination.” 2014. Web. 28 Sep 2020.

Vancouver:

Hsu C. The Department Score Prediction and Analysis of the College Entrance Examination. [Internet] [Thesis]. NSYSU; 2014. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232.

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

Council of Science Editors:

Hsu C. The Department Score Prediction and Analysis of the College Entrance Examination. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719114-223232

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


NSYSU

5. Huang, Chang-Hao. Trading Strategy Mining with Gene Expression Programming.

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

 In the thesis, we apply the gene expression programming (GEP) to training profitable trading strategies. We propose a model which utilizes several historical periods that… (more)

Subjects/Keywords: Taiwan Stock Exchange Capitalization Weighted Stock Index; simple majority vote; feature set; strategy pool; gene expression programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, C. (2012). Trading Strategy Mining with Gene Expression Programming. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643

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

Huang, Chang-Hao. “Trading Strategy Mining with Gene Expression Programming.” 2012. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643.

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

MLA Handbook (7th Edition):

Huang, Chang-Hao. “Trading Strategy Mining with Gene Expression Programming.” 2012. Web. 28 Sep 2020.

Vancouver:

Huang C. Trading Strategy Mining with Gene Expression Programming. [Internet] [Thesis]. NSYSU; 2012. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643.

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

Council of Science Editors:

Huang C. Trading Strategy Mining with Gene Expression Programming. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-113643

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


NSYSU

6. Lin, Dong-Jian. Protein Contact Prediction Based on Protein Sequences.

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

 The biological function of a protein is mainly maintained by its three-dimensional structure. Protein folds support the three-dimensional structure of a protein, and then the… (more)

Subjects/Keywords: prediction; Contact; SVM; KNN; PDA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, D. (2011). Protein Contact Prediction Based on Protein Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445

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, Dong-Jian. “Protein Contact Prediction Based on Protein Sequences.” 2011. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445.

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

MLA Handbook (7th Edition):

Lin, Dong-Jian. “Protein Contact Prediction Based on Protein Sequences.” 2011. Web. 28 Sep 2020.

Vancouver:

Lin D. Protein Contact Prediction Based on Protein Sequences. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445.

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

Council of Science Editors:

Lin D. Protein Contact Prediction Based on Protein Sequences. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0906111-150445

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


NSYSU

7. Fang, Chun-yi. The Disulfide Bonding Pattern Prediction with the Cysteine Labels.

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

 There are four versions for the disulfide prediction problem, including chain classification, bonding state of each cysteine, connectivity of each cysteines pair and disulfide bonding… (more)

Subjects/Keywords: behavior knowledge space; disulfide bond; support vector machine; protein; cysteine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fang, C. (2015). The Disulfide Bonding Pattern Prediction with the Cysteine Labels. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637

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

Fang, Chun-yi. “The Disulfide Bonding Pattern Prediction with the Cysteine Labels.” 2015. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637.

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

MLA Handbook (7th Edition):

Fang, Chun-yi. “The Disulfide Bonding Pattern Prediction with the Cysteine Labels.” 2015. Web. 28 Sep 2020.

Vancouver:

Fang C. The Disulfide Bonding Pattern Prediction with the Cysteine Labels. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637.

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

Council of Science Editors:

Fang C. The Disulfide Bonding Pattern Prediction with the Cysteine Labels. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0105115-014637

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


NSYSU

8. Chiu, Hsuan-Tsung. The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems.

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

 The similarity of one-dimensional data is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the… (more)

Subjects/Keywords: Satisfiabiliy; APX-hard; NP-hard; Similarity; Longest common subsequence; 3-dimensional matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiu, H. (2017). The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404

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

Chiu, Hsuan-Tsung. “The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems.” 2017. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404.

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

MLA Handbook (7th Edition):

Chiu, Hsuan-Tsung. “The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems.” 2017. Web. 28 Sep 2020.

Vancouver:

Chiu H. The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404.

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

Council of Science Editors:

Chiu H. The NP-hardness and APX-hardness of the Two-dimensional Largest Common Substructure Problems. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143404

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


NSYSU

9. Hung, Shu-Kai. An Algorithm for Time Series Classification Using Dissimilarity Space.

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

 ABSTRACT The time series classification problem is aimed to classify a new time series to a suitable class and then to give this time series… (more)

Subjects/Keywords: SVM; Time series; Dynamic time warping; Dissimilarity space; Ensemble

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, S. (2017). An Algorithm for Time Series Classification Using Dissimilarity Space. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059

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

Hung, Shu-Kai. “An Algorithm for Time Series Classification Using Dissimilarity Space.” 2017. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059.

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

MLA Handbook (7th Edition):

Hung, Shu-Kai. “An Algorithm for Time Series Classification Using Dissimilarity Space.” 2017. Web. 28 Sep 2020.

Vancouver:

Hung S. An Algorithm for Time Series Classification Using Dissimilarity Space. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059.

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

Council of Science Editors:

Hung S. An Algorithm for Time Series Classification Using Dissimilarity Space. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0807117-143059

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


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 September 28, 2020. 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. 28 Sep 2020.

Vancouver:

Lin B. The Algorithms for the Linear Space S-table on the Longest Common Subsequence Problem. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Sep 28]. 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. Hung, Hsiu-Chieh. A Prune-and-Search Algorithm for Finding the Most Similar Sequence.

Degree: Master, Institute Of Computer Science And Engineering, 2018, NSYSU

 For finding the most similar sequence in a character-sequence database, it is very time-consuming if the one-by-one sequential search strategy is applied. In the previous… (more)

Subjects/Keywords: L1-norm; Manhattan distance; triangle inequality; character-sequence database; edit distance; the most similar sequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, H. (2018). A Prune-and-Search Algorithm for Finding the Most Similar Sequence. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347

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

Hung, Hsiu-Chieh. “A Prune-and-Search Algorithm for Finding the Most Similar Sequence.” 2018. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347.

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

MLA Handbook (7th Edition):

Hung, Hsiu-Chieh. “A Prune-and-Search Algorithm for Finding the Most Similar Sequence.” 2018. Web. 28 Sep 2020.

Vancouver:

Hung H. A Prune-and-Search Algorithm for Finding the Most Similar Sequence. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347.

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

Council of Science Editors:

Hung H. A Prune-and-Search Algorithm for Finding the Most Similar Sequence. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0702118-135347

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


NSYSU

12. Weng, Hsiang-yi. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.

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

 The k-LCS problem is to find the longest common subsequence (LCS) of k input sequences. It is difficult while the number of input sequences is… (more)

Subjects/Keywords: Ant Colony Optimization Algorithm; genetic algorithm; longest common subsequence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weng, H. (2009). A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733

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

Weng, Hsiang-yi. “A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733.

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

MLA Handbook (7th Edition):

Weng, Hsiang-yi. “A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences.” 2009. Web. 28 Sep 2020.

Vancouver:

Weng H. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. [Internet] [Thesis]. NSYSU; 2009. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733.

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

Council of Science Editors:

Weng H. A Hybrid Algorithm for the Longest Common Subsequence of Multiple Sequences. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0819109-141733

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


NSYSU

13. Chen, Hung-Hsin. Genetic Programming for the Investment of the Mutual Fund with Sortino Ratio and Mean Variance Model.

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

 In this thesis, we propose two genetic-programming-based models that improve the trading strategies for mutual funds. These two models can help investors get returns and… (more)

Subjects/Keywords: genetic programming; trading strategy; return; Sortino ratio; risk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, H. (2010). Genetic Programming for the Investment of the Mutual Fund with Sortino Ratio and Mean Variance Model. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824110-122030

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

Chen, Hung-Hsin. “Genetic Programming for the Investment of the Mutual Fund with Sortino Ratio and Mean Variance Model.” 2010. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824110-122030.

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

MLA Handbook (7th Edition):

Chen, Hung-Hsin. “Genetic Programming for the Investment of the Mutual Fund with Sortino Ratio and Mean Variance Model.” 2010. Web. 28 Sep 2020.

Vancouver:

Chen H. Genetic Programming for the Investment of the Mutual Fund with Sortino Ratio and Mean Variance Model. [Internet] [Thesis]. NSYSU; 2010. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824110-122030.

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

Council of Science Editors:

Chen H. Genetic Programming for the Investment of the Mutual Fund with Sortino Ratio and Mean Variance Model. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824110-122030

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


NSYSU

14. Chung, Wei-Chun. A Multi-phase Approach for Disulfide Bond Prediction.

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

 Disulfide bond information can help the prediction of protein secondary structure, tertiary structure and all-atom coordinates. Most of previous works focused on either state classification… (more)

Subjects/Keywords: disulfide bond; prediction; multi-phase; cysteine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chung, W. (2009). A Multi-phase Approach for Disulfide Bond Prediction. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725109-190346

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

Chung, Wei-Chun. “A Multi-phase Approach for Disulfide Bond Prediction.” 2009. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725109-190346.

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

MLA Handbook (7th Edition):

Chung, Wei-Chun. “A Multi-phase Approach for Disulfide Bond Prediction.” 2009. Web. 28 Sep 2020.

Vancouver:

Chung W. A Multi-phase Approach for Disulfide Bond Prediction. [Internet] [Thesis]. NSYSU; 2009. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725109-190346.

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

Council of Science Editors:

Chung W. A Multi-phase Approach for Disulfide Bond Prediction. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725109-190346

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


NSYSU

15. Cheng, Kai-Yuan. The Longest Common Subsequence Problem with a Gapped Constraint.

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

 This thesis considers a variant of the classical problem for finding the longest common subsequence (LCS) called longest common subsequence problem with a gapped constraint… (more)

Subjects/Keywords: DP; Dynamic Programming; constraint; CLCS; LCS; Gap

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, K. (2012). The Longest Common Subsequence Problem with a Gapped Constraint. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312

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

Cheng, Kai-Yuan. “The Longest Common Subsequence Problem with a Gapped Constraint.” 2012. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312.

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

MLA Handbook (7th Edition):

Cheng, Kai-Yuan. “The Longest Common Subsequence Problem with a Gapped Constraint.” 2012. Web. 28 Sep 2020.

Vancouver:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Internet] [Thesis]. NSYSU; 2012. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312.

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

Council of Science Editors:

Cheng K. The Longest Common Subsequence Problem with a Gapped Constraint. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912112-090312

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


NSYSU

16. Lin, Shian-liang. A Survey on the Algorithms of the Edit Distance Problem and Related Variants.

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

 Abstract The edit distance problem has been studied for several decades. Given sequences (strings) A and B with length m and n, respectively, m ⤅ (more)

Subjects/Keywords: Genome Rearrangement; Similarity; Dynamic Programing; Longest Common Subsequence; Edit Distance; Block Edit

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, S. (2016). A Survey on the Algorithms of the Edit Distance Problem and Related Variants. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529

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, Shian-liang. “A Survey on the Algorithms of the Edit Distance Problem and Related Variants.” 2016. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529.

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

MLA Handbook (7th Edition):

Lin, Shian-liang. “A Survey on the Algorithms of the Edit Distance Problem and Related Variants.” 2016. Web. 28 Sep 2020.

Vancouver:

Lin S. A Survey on the Algorithms of the Edit Distance Problem and Related Variants. [Internet] [Thesis]. NSYSU; 2016. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529.

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

Council of Science Editors:

Lin S. A Survey on the Algorithms of the Edit Distance Problem and Related Variants. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0806116-215529

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


NSYSU

17. Hsu, Tzu-Chiang. An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition.

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

 Reacting to the growing interest in large-scale mutation events, Ta et al. introduced the non-overlapping inversion and transposition distance problem in 2015, which is to… (more)

Subjects/Keywords: Non-Overlapping; Genome Rearrangement; Inversion; Transposition; Dynamic Programming; Run

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, T. (2017). An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149

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

Hsu, Tzu-Chiang. “An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition.” 2017. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149.

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

MLA Handbook (7th Edition):

Hsu, Tzu-Chiang. “An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition.” 2017. Web. 28 Sep 2020.

Vancouver:

Hsu T. An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149.

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

Council of Science Editors:

Hsu T. An Algorithm for Computing the Distance of the Non-overlapping Inversion and Transposition. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0022117-230149

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


NSYSU

18. Ho, Wen-chuan. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.

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

 Given three sequences A, B and C with lengths of m, n and r, respectively, the constrained longest common subsequence (CLCS) problem is to find… (more)

Subjects/Keywords: Small alphabet; Dynamic Programming; Similar; CLCS; LCS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ho, W. (2017). A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730

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

Ho, Wen-chuan. “A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.” 2017. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730.

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

MLA Handbook (7th Edition):

Ho, Wen-chuan. “A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet.” 2017. Web. 28 Sep 2020.

Vancouver:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730.

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

Council of Science Editors:

Ho W. A Fast Algorithm for the Constrained Longest Common Subsequence Problem with Small Alphabet. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0023117-160730

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


NSYSU

19. Guo, Guan-cheng. Training Strategies for the Time Series Classification Problem.

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

 The time series classification problem has been studied for decades. The dynamic time warping (DTW) algorithm provides a powerful way to measure the distance between… (more)

Subjects/Keywords: Time series classification; Training strategy; Variable gap longest common subsequence; Longest common subsequence; Variable gap longest common subsequence similarity measure; Behavior knowledge space; Dynamic time warping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, G. (2015). Training Strategies for the Time Series Classification Problem. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801115-183737

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

Guo, Guan-cheng. “Training Strategies for the Time Series Classification Problem.” 2015. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801115-183737.

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

MLA Handbook (7th Edition):

Guo, Guan-cheng. “Training Strategies for the Time Series Classification Problem.” 2015. Web. 28 Sep 2020.

Vancouver:

Guo G. Training Strategies for the Time Series Classification Problem. [Internet] [Thesis]. NSYSU; 2015. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801115-183737.

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

Council of Science Editors:

Guo G. Training Strategies for the Time Series Classification Problem. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0801115-183737

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


NSYSU

20. Liu, Chu-Kai. Prediction for the Domain of RNA with Support Vector Machine.

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

 The three-domain system is a biological classification of RNA. In bioinformatics, predicting the domain of RNA is helpful in the research of DNA and protein.… (more)

Subjects/Keywords: secondary structure; SVM; prediction; RNA; three-domain system

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, C. (2011). Prediction for the Domain of RNA with Support Vector Machine. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901111-194100

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

Liu, Chu-Kai. “Prediction for the Domain of RNA with Support Vector Machine.” 2011. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901111-194100.

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

MLA Handbook (7th Edition):

Liu, Chu-Kai. “Prediction for the Domain of RNA with Support Vector Machine.” 2011. Web. 28 Sep 2020.

Vancouver:

Liu C. Prediction for the Domain of RNA with Support Vector Machine. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901111-194100.

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

Council of Science Editors:

Liu C. Prediction for the Domain of RNA with Support Vector Machine. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0901111-194100

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


NSYSU

21. Jhou, Siao-ming. Taiwan Stock Forecasting with the Genetic Programming.

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

 In this thesis, we propose a model which applies the genetic programming (GP) to train the profitable and stable trading strategy in the training period,… (more)

Subjects/Keywords: Stock; Taiwan Stock Exchange Capitalization Weighted Stock Index; genetic programming; annualized return; feature set

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jhou, S. (2011). Taiwan Stock Forecasting with the Genetic Programming. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-201917

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

Jhou, Siao-ming. “Taiwan Stock Forecasting with the Genetic Programming.” 2011. Thesis, NSYSU. Accessed September 28, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-201917.

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

MLA Handbook (7th Edition):

Jhou, Siao-ming. “Taiwan Stock Forecasting with the Genetic Programming.” 2011. Web. 28 Sep 2020.

Vancouver:

Jhou S. Taiwan Stock Forecasting with the Genetic Programming. [Internet] [Thesis]. NSYSU; 2011. [cited 2020 Sep 28]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-201917.

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

Council of Science Editors:

Jhou S. Taiwan Stock Forecasting with the Genetic Programming. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0907111-201917

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

.