Tsutomu Maruyama

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Shingo Masuno

> Home > Persons > Tsutomu Maruyama

Publications

2007
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/ieicet/MasunoMYK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicet/MasunoMYK07
Shingo Masuno, Tsutomu Maruyama, Yoshiki Yamaguchi, Akihiko Konagaya:
Multiple Sequence Alignment Based on Dynamic Programming Using FPGA. IEICE Trans. Inf. Syst. 90-D(12): 1939-1946 (2007)
[c49]
- view
  authority control:
- export record
  dblp key:
  - conf/fpl/MasunoMYK07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fpl/MasunoMYK07
Shingo Masuno, Tsutomu Maruyama, Yoshiki Yamaguchi, Akihiko Konagaya:
An FPGA Implementation of Multiple Sequence Alignment Based on Carrillo-Lipman Method. FPL 2007: 489-492
2006
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/europar/MasunoMYK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/europar/MasunoMYK06
Shingo Masuno, Tsutomu Maruyama, Yoshiki Yamaguchi, Akihiko Konagaya:
Multidimensional Dynamic Programming for Homology Search on Distributed Systems. Euro-Par 2006: 1127-1137
2005
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/fpl/MasunoMYK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fpl/MasunoMYK05
Shingo Masuno, Tsutomu Maruyama, Yoshiki Yamaguchi, Akihiko Konagaya:
Multidimensional Dynamic Programming for Homology Search. FPL 2005: 173-178

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.