I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
An Approach for Improving Complexity of Longest Common Subs..:
, In:
2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)
,
Bhowmick, Ratul
;
Sadek Bhuiyan, Md Ibrahim
;
Sabir Hossain, Md.
.. - p. 1-5 , 2019
Link:
https://doi.org/10.1109/ICASERT.2019.8934638
RT T1
2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT)
: T1
An Approach for Improving Complexity of Longest Common Subsequence Problems using Queue and Divide-and-Conquer Method
UL https://suche.suub.uni-bremen.de/peid=ieee-8934638&Exemplar=1&LAN=DE A1 Bhowmick, Ratul A1 Sadek Bhuiyan, Md Ibrahim A1 Sabir Hossain, Md. A1 Hossen, Muhammad Kamal A1 Sadee Tanim, Ahsan YR 2019 K1 Heuristic algorithms K1 Time complexity K1 Arrays K1 DNA K1 Sequential analysis K1 Longest Common Subsequence K1 Queue K1 Divide and conquer K1 Dynamic Programming K1 Recursion SP 1 OP 5 LK http://dx.doi.org/https://doi.org/10.1109/ICASERT.2019.8934638 DO https://doi.org/10.1109/ICASERT.2019.8934638 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)