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
Quick-MLCS : a new algorithm for the multiple longest co..:
, In:
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
,
Sazvar, Majid
;
Naghibzadeh, Mahmoud
;
Saadati, Nayyereh
- p. 61-66 , 2012
Link:
https://dl.acm.org/doi/10.1145/2347583.2347591
RT T1 <cTitle>Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering</cTitle>: T1 <Title>Quick-MLCS : a new algorithm for the multiple longest common subsequence problem</Title> UL https://suche.suub.uni-bremen.de/peid=acm-2347591&Exemplar=1&LAN=DE A1 Sazvar, Majid A1 Naghibzadeh, Mahmoud A1 Saadati, Nayyereh PB ACM YR 2012 K1 DNA sequence K1 dominant point approach K1 linear sorting K1 longest common subsequence K1 multiple longest common subsequence K1 protein sequence K1 Theory of computation K1 Randomness, geometry and discrete structures K1 Design and analysis of algorithms K1 Data structures design and analysis K1 Sorting and searching SP 61 OP 66 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/2347583.2347591 DO https://dl.acm.org/doi/10.1145/2347583.2347591 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
