Items related to MapReduce Based Approach to Longest Common Subsequence...
Synopsis
The Longest Common Subsequence(LCS) identification of biological sequences has significant applications in bioinformatics. Due to the emerging growth in bioinformatics applications, new biological sequences with longer length have been used for processing, making it great challenge for sequential LCS algorithms. Few parallel LCS algorithms have been proposed but their efficiency and effectiveness are not satisfactory with increasing complexity and size of biological data. To overcome limitations of existing LCS algorithms and considering MapReduce programming model as promising technology for cost effective high performance parallel computing, MapReduce based parallel algorithm for LCS has been developed. This approach adopts the concepts of successor tables, identical character pairs, successor tree and traversal of successor tree to find Longest Common Subsequence. The hadoop framework is used for the realization of MapReduce model.
"synopsis" may belong to another edition of this title.
Search results for MapReduce Based Approach to Longest Common Subsequence...
Seller Image
MapReduce Based Approach to Longest Common Subsequence in BioSequences
Published by
LAP LAMBERT Academic Publishing Mär 2015, 2015
ISBN 10: 3659680508
ISBN 13: 9783659680502
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Longest Common Subsequence(LCS) identification of biological sequences has significant applications in bioinformatics. Due to the emerging growth in bioinformatics applications, new biological sequences with longer length have been used for processing, making it great challenge for sequential LCS algorithms. Few parallel LCS algorithms have been proposed but their efficiency and effectiveness are not satisfactory with increasing complexity and size of biological data. To overcome limitations of existing LCS algorithms and considering MapReduce programming model as promising technology for cost effective high performance parallel computing, MapReduce based parallel algorithm for LCS has been developed. This approach adopts the concepts of successor tables, identical character pairs, successor tree and traversal of successor tree to find Longest Common Subsequence. The hadoop framework is used for the realization of MapReduce model. 56 pp. Englisch. Seller Inventory # 9783659680502
Seller Image
MapReduce Based Approach to Longest Common Subsequence in BioSequences
Published by
LAP LAMBERT Academic Publishing, 2015
ISBN 10: 3659680508
ISBN 13: 9783659680502
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Bohara JnaneshwarMr. Bohara,Computer Engineer at Government of Nepal, is the university topper in M.Sc. in Computer System and Knowledge Engineering at Institute of Engineering(IOE),Tribhuwan University. He worked for 5 years as Sr J. Seller Inventory # 21942183
Buy New
£ 30.35
£ 42.14 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
MapReduce Based Approach to Longest Common Subsequence in BioSequences
Published by
LAP LAMBERT Academic Publishing Mär 2015, 2015
ISBN 10: 3659680508
ISBN 13: 9783659680502
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The Longest Common Subsequence(LCS) identification of biological sequences has significant applications in bioinformatics. Due to the emerging growth in bioinformatics applications, new biological sequences with longer length have been used for processing, making it great challenge for sequential LCS algorithms. Few parallel LCS algorithms have been proposed but their efficiency and effectiveness are not satisfactory with increasing complexity and size of biological data. To overcome limitations of existing LCS algorithms and considering MapReduce programming model as promising technology for cost effective high performance parallel computing, MapReduce based parallel algorithm for LCS has been developed. This approach adopts the concepts of successor tables, identical character pairs, successor tree and traversal of successor tree to find Longest Common Subsequence. The hadoop framework is used for the realization of MapReduce model.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 56 pp. Englisch. Seller Inventory # 9783659680502
Seller Image
MapReduce Based Approach to Longest Common Subsequence in BioSequences
Published by
LAP LAMBERT Academic Publishing, 2015
ISBN 10: 3659680508
ISBN 13: 9783659680502
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The Longest Common Subsequence(LCS) identification of biological sequences has significant applications in bioinformatics. Due to the emerging growth in bioinformatics applications, new biological sequences with longer length have been used for processing, making it great challenge for sequential LCS algorithms. Few parallel LCS algorithms have been proposed but their efficiency and effectiveness are not satisfactory with increasing complexity and size of biological data. To overcome limitations of existing LCS algorithms and considering MapReduce programming model as promising technology for cost effective high performance parallel computing, MapReduce based parallel algorithm for LCS has been developed. This approach adopts the concepts of successor tables, identical character pairs, successor tree and traversal of successor tree to find Longest Common Subsequence. The hadoop framework is used for the realization of MapReduce model. Seller Inventory # 9783659680502
Seller Image
MapReduce Based Approach to Longest Common Subsequence in BioSequences
Published by
LAP LAMBERT Academic Publishing, 2015
ISBN 10: 3659680508
ISBN 13: 9783659680502
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. MapReduce Based Approach to Longest Common Subsequence in BioSequences | Jnaneshwar Bohara (u. a.) | Taschenbuch | 56 S. | Englisch | 2015 | LAP LAMBERT Academic Publishing | EAN 9783659680502 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 104759262