Bohara Jnaneshwar (64 results)

Condition: New.

Paperback or Softback. Condition: New. Approccio basato su MapReduce alla sottosequenza comune pi� lunga nelle sequenze biologiche. Book.

Condition: New.

Condition: New.

Condition: New.

Condition: New.

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

Condition: New.

Taschenbuch. Condition: Neu. Approche basée sur MapReduce pour la plus longue sous-séquence commune dans les séquences biologiques | Jnaneshwar Bohara (u. a.) | Taschenbuch | Französisch | 2025 | Editions Notre Savoir | EAN 9786208459765 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.…

Condition: New.

Condition: New.

Condition: New.

Condition: New.

Taschenbuch. Condition: Neu. Abordagem baseada em MapReduce para a sequência comum mais longa em biosequências | Jnaneshwar Bohara (u. a.) | Taschenbuch | Portugiesisch | 2025 | Edições Nosso Conhecimento | EAN 9786208499785 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.…

Taschenbuch. Condition: Neu. Approccio basato su MapReduce alla sottosequenza comune più lunga nelle sequenze biologiche | Jnaneshwar Bohara (u. a.) | Taschenbuch | Italienisch | 2025 | Edizioni Sapienza | EAN 9786208459611 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.…

Taschenbuch. Condition: Neu. MapReduce-basierter Ansatz für die längste gemeinsame Teilsequenz in BioSequenzen | Jnaneshwar Bohara (u. a.) | Taschenbuch | 56 S. | Deutsch | 2025 | Verlag Unser Wissen | EAN 9786208499372 | Verantwortliche Person für die EU: SIA OmniScriptum Publishing, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: preigu.…

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

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

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 52 pp. Spanisch.

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

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

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

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.